./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a02d6b34f153beaa9e9eac4f5ac19280cae90251 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:40,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:23:40,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:23:40,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:23:40,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:23:40,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:23:40,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:23:40,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:23:40,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:23:40,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:23:40,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:23:40,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:23:40,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:23:40,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:23:40,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:23:40,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:23:40,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:23:40,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:23:40,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:23:40,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:23:40,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:23:40,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:23:40,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:23:40,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:23:40,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:23:40,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:23:40,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:23:40,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:23:40,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:23:40,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:23:40,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:23:40,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:23:40,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:23:40,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:23:40,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:23:40,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:23:40,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:23:40,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:23:40,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:23:40,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:23:40,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:23:40,830 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:40,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:23:40,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:23:40,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:23:40,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:23:40,860 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:23:40,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:23:40,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:23:40,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:23:40,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:23:40,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:23:40,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:23:40,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:23:40,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:23:40,863 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:23:40,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:23:40,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:23:40,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:23:40,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:23:40,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:23:40,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:23:40,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:23:40,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:23:40,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:23:40,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:23:40,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:23:40,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:23:40,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:23:40,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:23:40,867 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:23:40,867 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 -> a02d6b34f153beaa9e9eac4f5ac19280cae90251 [2019-11-28 18:23:41,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:23:41,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:23:41,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:23:41,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:23:41,205 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:23:41,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i [2019-11-28 18:23:41,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025024a66/3a03b8e7d92a46928da59690054237dc/FLAG2b10318ab [2019-11-28 18:23:41,905 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:23:41,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i [2019-11-28 18:23:41,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025024a66/3a03b8e7d92a46928da59690054237dc/FLAG2b10318ab [2019-11-28 18:23:42,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025024a66/3a03b8e7d92a46928da59690054237dc [2019-11-28 18:23:42,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:23:42,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:23:42,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:42,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:23:42,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:23:42,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:42" (1/1) ... [2019-11-28 18:23:42,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d9c01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:42, skipping insertion in model container [2019-11-28 18:23:42,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:42" (1/1) ... [2019-11-28 18:23:42,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:23:42,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:23:42,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:42,746 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:23:42,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:42,917 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:23:42,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:42 WrapperNode [2019-11-28 18:23:42,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:42,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:42,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:23:42,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:23:42,927 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:42" (1/1) ... [2019-11-28 18:23:42,948 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:42" (1/1) ... [2019-11-28 18:23:42,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:42,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:23:42,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:23:42,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:23:43,004 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:42" (1/1) ... [2019-11-28 18:23:43,004 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:42" (1/1) ... [2019-11-28 18:23:43,010 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:42" (1/1) ... [2019-11-28 18:23:43,010 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:42" (1/1) ... [2019-11-28 18:23:43,022 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:42" (1/1) ... [2019-11-28 18:23:43,027 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:42" (1/1) ... [2019-11-28 18:23:43,032 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:42" (1/1) ... [2019-11-28 18:23:43,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:23:43,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:23:43,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:23:43,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:23:43,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:42" (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:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:23:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:23:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:23:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:23:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:23:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:23:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:23:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:23:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:23:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:23:43,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:23:43,114 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:43,957 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:23:43,957 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:23:43,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:43 BoogieIcfgContainer [2019-11-28 18:23:43,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:23:43,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:23:43,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:23:43,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:23:43,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:23:42" (1/3) ... [2019-11-28 18:23:43,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3df6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:43, skipping insertion in model container [2019-11-28 18:23:43,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:42" (2/3) ... [2019-11-28 18:23:43,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3df6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:43, skipping insertion in model container [2019-11-28 18:23:43,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:43" (3/3) ... [2019-11-28 18:23:43,969 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt.i [2019-11-28 18:23:43,979 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:23:43,980 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:23:43,988 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:23:43,989 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:23:44,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,039 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,039 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,039 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:44,089 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:23:44,114 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:23:44,115 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:23:44,115 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:23:44,115 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:23:44,115 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:23:44,115 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:23:44,115 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:23:44,116 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:23:44,136 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-11-28 18:23:44,139 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-11-28 18:23:44,258 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-11-28 18:23:44,259 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:44,292 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 870 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-11-28 18:23:44,350 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-11-28 18:23:44,463 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-11-28 18:23:44,464 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:44,483 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 870 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-11-28 18:23:44,530 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-11-28 18:23:44,532 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:23:49,930 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:23:50,082 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142511 [2019-11-28 18:23:50,082 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-11-28 18:23:50,086 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-11-28 18:23:52,023 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-11-28 18:23:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-11-28 18:23:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:23:52,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:52,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:23:52,034 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:52,040 INFO L82 PathProgramCache]: Analyzing trace with hash 979333444, now seen corresponding path program 1 times [2019-11-28 18:23:52,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:52,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264908673] [2019-11-28 18:23:52,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:52,318 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:52,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264908673] [2019-11-28 18:23:52,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:52,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:52,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108484208] [2019-11-28 18:23:52,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:52,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:52,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:52,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:52,345 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-11-28 18:23:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:52,826 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-11-28 18:23:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:52,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:23:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:53,089 INFO L225 Difference]: With dead ends: 27436 [2019-11-28 18:23:53,089 INFO L226 Difference]: Without dead ends: 26890 [2019-11-28 18:23:53,091 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:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-11-28 18:23:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-11-28 18:23:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-11-28 18:23:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-11-28 18:23:54,745 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-11-28 18:23:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:54,745 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-11-28 18:23:54,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-11-28 18:23:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:23:54,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:54,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:54,750 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1135413059, now seen corresponding path program 1 times [2019-11-28 18:23:54,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:54,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872273332] [2019-11-28 18:23:54,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:54,881 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:54,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872273332] [2019-11-28 18:23:54,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:54,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:54,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264493410] [2019-11-28 18:23:54,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:54,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:54,887 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-11-28 18:23:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:55,526 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-11-28 18:23:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:55,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:23:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:55,803 INFO L225 Difference]: With dead ends: 43282 [2019-11-28 18:23:55,804 INFO L226 Difference]: Without dead ends: 43275 [2019-11-28 18:23:55,805 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:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-11-28 18:23:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-11-28 18:23:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-11-28 18:23:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-11-28 18:23:57,786 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-11-28 18:23:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:57,787 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-11-28 18:23:57,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-11-28 18:23:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:23:57,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:57,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:57,791 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash -217981421, now seen corresponding path program 1 times [2019-11-28 18:23:57,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:57,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872958627] [2019-11-28 18:23:57,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:57,873 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:57,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872958627] [2019-11-28 18:23:57,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:57,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:57,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727317951] [2019-11-28 18:23:57,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:57,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:57,875 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-11-28 18:23:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:58,935 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-11-28 18:23:58,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:58,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:23:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:59,124 INFO L225 Difference]: With dead ends: 53078 [2019-11-28 18:23:59,125 INFO L226 Difference]: Without dead ends: 53078 [2019-11-28 18:23:59,126 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:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-11-28 18:24:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-11-28 18:24:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-11-28 18:24:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-11-28 18:24:00,756 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-11-28 18:24:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:00,756 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-11-28 18:24:00,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-11-28 18:24:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:24:00,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:00,764 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:24:00,765 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1239203888, now seen corresponding path program 1 times [2019-11-28 18:24:00,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:00,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471420963] [2019-11-28 18:24:00,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:00,865 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:24:00,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471420963] [2019-11-28 18:24:00,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:00,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:00,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652245621] [2019-11-28 18:24:00,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:00,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:00,870 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-11-28 18:24:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:02,528 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-11-28 18:24:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:24:02,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 18:24:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:02,713 INFO L225 Difference]: With dead ends: 63010 [2019-11-28 18:24:02,713 INFO L226 Difference]: Without dead ends: 63003 [2019-11-28 18:24:02,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:24:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-11-28 18:24:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-11-28 18:24:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-11-28 18:24:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-11-28 18:24:04,155 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-11-28 18:24:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:04,155 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-11-28 18:24:04,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-11-28 18:24:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:24:04,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:04,183 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:24:04,183 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1918132910, now seen corresponding path program 1 times [2019-11-28 18:24:04,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:04,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832651804] [2019-11-28 18:24:04,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:04,269 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:24:04,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832651804] [2019-11-28 18:24:04,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:04,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:04,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136734950] [2019-11-28 18:24:04,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:04,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:04,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:04,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:04,272 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-11-28 18:24:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:04,318 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-11-28 18:24:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:24:04,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-28 18:24:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:04,327 INFO L225 Difference]: With dead ends: 5620 [2019-11-28 18:24:04,327 INFO L226 Difference]: Without dead ends: 4725 [2019-11-28 18:24:04,328 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:24:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-11-28 18:24:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-11-28 18:24:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-28 18:24:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-11-28 18:24:04,405 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-11-28 18:24:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:04,406 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-11-28 18:24:04,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-11-28 18:24:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 18:24:04,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:04,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:04,412 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2102045766, now seen corresponding path program 1 times [2019-11-28 18:24:04,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:04,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006902987] [2019-11-28 18:24:04,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:04,567 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:24:04,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006902987] [2019-11-28 18:24:04,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:04,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:24:04,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144591762] [2019-11-28 18:24:04,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:04,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:04,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:04,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:04,570 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-11-28 18:24:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:04,613 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-11-28 18:24:04,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:04,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-28 18:24:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:04,616 INFO L225 Difference]: With dead ends: 1095 [2019-11-28 18:24:04,616 INFO L226 Difference]: Without dead ends: 991 [2019-11-28 18:24:04,616 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:24:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-28 18:24:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-11-28 18:24:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-11-28 18:24:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-11-28 18:24:04,626 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-11-28 18:24:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:04,627 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-11-28 18:24:04,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-11-28 18:24:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 18:24:04,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:04,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:04,630 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1081276424, now seen corresponding path program 1 times [2019-11-28 18:24:04,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:04,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143674224] [2019-11-28 18:24:04,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:04,740 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:24:04,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143674224] [2019-11-28 18:24:04,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:04,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:24:04,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512185666] [2019-11-28 18:24:04,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:24:04,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:24:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:04,743 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-11-28 18:24:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:05,556 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-11-28 18:24:05,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:24:05,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-28 18:24:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:05,558 INFO L225 Difference]: With dead ends: 1405 [2019-11-28 18:24:05,559 INFO L226 Difference]: Without dead ends: 1405 [2019-11-28 18:24:05,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:24:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-11-28 18:24:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-11-28 18:24:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-11-28 18:24:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-11-28 18:24:05,575 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-11-28 18:24:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:05,575 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-11-28 18:24:05,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:24:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-11-28 18:24:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 18:24:05,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:05,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:05,579 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash 188736084, now seen corresponding path program 2 times [2019-11-28 18:24:05,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:05,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745632953] [2019-11-28 18:24:05,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:05,761 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:24:05,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745632953] [2019-11-28 18:24:05,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:05,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:24:05,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841015101] [2019-11-28 18:24:05,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:24:05,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:24:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:05,764 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 6 states. [2019-11-28 18:24:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:06,392 INFO L93 Difference]: Finished difference Result 1322 states and 2786 transitions. [2019-11-28 18:24:06,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:24:06,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-28 18:24:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:06,395 INFO L225 Difference]: With dead ends: 1322 [2019-11-28 18:24:06,395 INFO L226 Difference]: Without dead ends: 1322 [2019-11-28 18:24:06,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:24:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-28 18:24:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1237. [2019-11-28 18:24:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-11-28 18:24:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2629 transitions. [2019-11-28 18:24:06,411 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2629 transitions. Word has length 68 [2019-11-28 18:24:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:06,412 INFO L462 AbstractCegarLoop]: Abstraction has 1237 states and 2629 transitions. [2019-11-28 18:24:06,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:24:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2629 transitions. [2019-11-28 18:24:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 18:24:06,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:06,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:06,414 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1869906086, now seen corresponding path program 3 times [2019-11-28 18:24:06,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:06,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476303533] [2019-11-28 18:24:06,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:06,526 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:24:06,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476303533] [2019-11-28 18:24:06,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:06,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:24:06,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399641336] [2019-11-28 18:24:06,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:06,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:06,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:06,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:06,535 INFO L87 Difference]: Start difference. First operand 1237 states and 2629 transitions. Second operand 5 states. [2019-11-28 18:24:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:06,778 INFO L93 Difference]: Finished difference Result 1390 states and 2909 transitions. [2019-11-28 18:24:06,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:24:06,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-28 18:24:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:06,781 INFO L225 Difference]: With dead ends: 1390 [2019-11-28 18:24:06,781 INFO L226 Difference]: Without dead ends: 1390 [2019-11-28 18:24:06,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-11-28 18:24:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1279. [2019-11-28 18:24:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-11-28 18:24:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2714 transitions. [2019-11-28 18:24:06,800 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2714 transitions. Word has length 68 [2019-11-28 18:24:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:06,800 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 2714 transitions. [2019-11-28 18:24:06,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2714 transitions. [2019-11-28 18:24:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 18:24:06,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:06,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:06,804 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash 395185618, now seen corresponding path program 4 times [2019-11-28 18:24:06,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:06,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978977766] [2019-11-28 18:24:06,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:06,949 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:24:06,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978977766] [2019-11-28 18:24:06,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:06,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:24:06,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903390208] [2019-11-28 18:24:06,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:24:06,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:06,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:24:06,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:24:06,952 INFO L87 Difference]: Start difference. First operand 1279 states and 2714 transitions. Second operand 8 states. [2019-11-28 18:24:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:07,514 INFO L93 Difference]: Finished difference Result 2280 states and 4779 transitions. [2019-11-28 18:24:07,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:24:07,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-11-28 18:24:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:07,518 INFO L225 Difference]: With dead ends: 2280 [2019-11-28 18:24:07,518 INFO L226 Difference]: Without dead ends: 2280 [2019-11-28 18:24:07,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:24:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2019-11-28 18:24:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1321. [2019-11-28 18:24:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-11-28 18:24:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2819 transitions. [2019-11-28 18:24:07,535 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2819 transitions. Word has length 68 [2019-11-28 18:24:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:07,536 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 2819 transitions. [2019-11-28 18:24:07,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:24:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2819 transitions. [2019-11-28 18:24:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 18:24:07,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:07,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:07,538 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash 155410772, now seen corresponding path program 5 times [2019-11-28 18:24:07,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:07,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070013214] [2019-11-28 18:24:07,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:24:07,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070013214] [2019-11-28 18:24:07,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:07,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:24:07,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763497421] [2019-11-28 18:24:07,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:24:07,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:07,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:24:07,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:24:07,695 INFO L87 Difference]: Start difference. First operand 1321 states and 2819 transitions. Second operand 8 states. [2019-11-28 18:24:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:08,587 INFO L93 Difference]: Finished difference Result 2184 states and 4603 transitions. [2019-11-28 18:24:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:24:08,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-11-28 18:24:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:08,591 INFO L225 Difference]: With dead ends: 2184 [2019-11-28 18:24:08,591 INFO L226 Difference]: Without dead ends: 2184 [2019-11-28 18:24:08,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:24:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-11-28 18:24:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1312. [2019-11-28 18:24:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-11-28 18:24:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2801 transitions. [2019-11-28 18:24:08,609 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2801 transitions. Word has length 68 [2019-11-28 18:24:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:08,609 INFO L462 AbstractCegarLoop]: Abstraction has 1312 states and 2801 transitions. [2019-11-28 18:24:08,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:24:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2801 transitions. [2019-11-28 18:24:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 18:24:08,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:08,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:08,612 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:08,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash -940338092, now seen corresponding path program 6 times [2019-11-28 18:24:08,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:08,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112607373] [2019-11-28 18:24:08,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:08,749 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:24:08,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112607373] [2019-11-28 18:24:08,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:08,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:24:08,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464524607] [2019-11-28 18:24:08,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:24:08,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:24:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:08,752 INFO L87 Difference]: Start difference. First operand 1312 states and 2801 transitions. Second operand 6 states. [2019-11-28 18:24:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:09,275 INFO L93 Difference]: Finished difference Result 1738 states and 3616 transitions. [2019-11-28 18:24:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:24:09,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-28 18:24:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:09,279 INFO L225 Difference]: With dead ends: 1738 [2019-11-28 18:24:09,279 INFO L226 Difference]: Without dead ends: 1738 [2019-11-28 18:24:09,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:24:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-11-28 18:24:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1318. [2019-11-28 18:24:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2019-11-28 18:24:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 2812 transitions. [2019-11-28 18:24:09,294 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 2812 transitions. Word has length 68 [2019-11-28 18:24:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:09,295 INFO L462 AbstractCegarLoop]: Abstraction has 1318 states and 2812 transitions. [2019-11-28 18:24:09,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:24:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 2812 transitions. [2019-11-28 18:24:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 18:24:09,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:09,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:09,297 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 29507545, now seen corresponding path program 1 times [2019-11-28 18:24:09,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:09,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876550514] [2019-11-28 18:24:09,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:09,510 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:24:09,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876550514] [2019-11-28 18:24:09,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:09,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:24:09,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789921964] [2019-11-28 18:24:09,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:24:09,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:09,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:24:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:24:09,513 INFO L87 Difference]: Start difference. First operand 1318 states and 2812 transitions. Second operand 9 states. [2019-11-28 18:24:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:10,435 INFO L93 Difference]: Finished difference Result 2153 states and 4512 transitions. [2019-11-28 18:24:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 18:24:10,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-11-28 18:24:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:10,438 INFO L225 Difference]: With dead ends: 2153 [2019-11-28 18:24:10,439 INFO L226 Difference]: Without dead ends: 2153 [2019-11-28 18:24:10,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:24:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2019-11-28 18:24:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1540. [2019-11-28 18:24:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-11-28 18:24:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 3281 transitions. [2019-11-28 18:24:10,457 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 3281 transitions. Word has length 69 [2019-11-28 18:24:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:10,457 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 3281 transitions. [2019-11-28 18:24:10,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:24:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 3281 transitions. [2019-11-28 18:24:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 18:24:10,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:10,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:10,460 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:10,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:10,460 INFO L82 PathProgramCache]: Analyzing trace with hash 668549763, now seen corresponding path program 2 times [2019-11-28 18:24:10,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:10,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497852851] [2019-11-28 18:24:10,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:10,569 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:24:10,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497852851] [2019-11-28 18:24:10,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:10,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:24:10,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676101748] [2019-11-28 18:24:10,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:24:10,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:24:10,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:10,573 INFO L87 Difference]: Start difference. First operand 1540 states and 3281 transitions. Second operand 6 states. [2019-11-28 18:24:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:10,687 INFO L93 Difference]: Finished difference Result 2032 states and 4301 transitions. [2019-11-28 18:24:10,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:24:10,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-28 18:24:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:10,689 INFO L225 Difference]: With dead ends: 2032 [2019-11-28 18:24:10,689 INFO L226 Difference]: Without dead ends: 433 [2019-11-28 18:24:10,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:24:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-28 18:24:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 381. [2019-11-28 18:24:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-28 18:24:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 688 transitions. [2019-11-28 18:24:10,697 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 688 transitions. Word has length 69 [2019-11-28 18:24:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:10,697 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 688 transitions. [2019-11-28 18:24:10,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:24:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 688 transitions. [2019-11-28 18:24:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 18:24:10,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:10,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:10,699 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash 330528570, now seen corresponding path program 1 times [2019-11-28 18:24:10,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:10,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211591018] [2019-11-28 18:24:10,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:10,765 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:24:10,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211591018] [2019-11-28 18:24:10,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:10,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:10,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181451399] [2019-11-28 18:24:10,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:24:10,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:24:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:24:10,768 INFO L87 Difference]: Start difference. First operand 381 states and 688 transitions. Second operand 3 states. [2019-11-28 18:24:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:10,778 INFO L93 Difference]: Finished difference Result 343 states and 597 transitions. [2019-11-28 18:24:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:24:10,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-28 18:24:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:10,780 INFO L225 Difference]: With dead ends: 343 [2019-11-28 18:24:10,780 INFO L226 Difference]: Without dead ends: 343 [2019-11-28 18:24:10,780 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:24:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-28 18:24:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-11-28 18:24:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-28 18:24:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 597 transitions. [2019-11-28 18:24:10,789 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 597 transitions. Word has length 69 [2019-11-28 18:24:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:10,789 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 597 transitions. [2019-11-28 18:24:10,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 597 transitions. [2019-11-28 18:24:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 18:24:10,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:10,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:10,791 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:10,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1263040810, now seen corresponding path program 1 times [2019-11-28 18:24:10,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:10,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598286369] [2019-11-28 18:24:10,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:11,103 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:24:11,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598286369] [2019-11-28 18:24:11,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:11,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:24:11,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92729547] [2019-11-28 18:24:11,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:24:11,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:24:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:24:11,110 INFO L87 Difference]: Start difference. First operand 343 states and 597 transitions. Second operand 12 states. [2019-11-28 18:24:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:11,908 INFO L93 Difference]: Finished difference Result 689 states and 1199 transitions. [2019-11-28 18:24:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:24:11,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2019-11-28 18:24:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:11,909 INFO L225 Difference]: With dead ends: 689 [2019-11-28 18:24:11,909 INFO L226 Difference]: Without dead ends: 689 [2019-11-28 18:24:11,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-11-28 18:24:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-28 18:24:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 393. [2019-11-28 18:24:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-28 18:24:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 682 transitions. [2019-11-28 18:24:11,915 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 682 transitions. Word has length 69 [2019-11-28 18:24:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:11,915 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 682 transitions. [2019-11-28 18:24:11,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:24:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 682 transitions. [2019-11-28 18:24:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 18:24:11,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:11,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:11,917 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:11,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash -59017392, now seen corresponding path program 1 times [2019-11-28 18:24:11,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:11,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860348984] [2019-11-28 18:24:11,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:11,991 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:24:11,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860348984] [2019-11-28 18:24:11,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:11,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:11,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248370598] [2019-11-28 18:24:11,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:24:11,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:11,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:24:11,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:24:11,994 INFO L87 Difference]: Start difference. First operand 393 states and 682 transitions. Second operand 3 states. [2019-11-28 18:24:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:12,030 INFO L93 Difference]: Finished difference Result 392 states and 680 transitions. [2019-11-28 18:24:12,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:24:12,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-28 18:24:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:12,031 INFO L225 Difference]: With dead ends: 392 [2019-11-28 18:24:12,031 INFO L226 Difference]: Without dead ends: 392 [2019-11-28 18:24:12,031 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:24:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-28 18:24:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 250. [2019-11-28 18:24:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-28 18:24:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 418 transitions. [2019-11-28 18:24:12,037 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 418 transitions. Word has length 70 [2019-11-28 18:24:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:12,038 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 418 transitions. [2019-11-28 18:24:12,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 418 transitions. [2019-11-28 18:24:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 18:24:12,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:12,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:12,039 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:12,040 INFO L82 PathProgramCache]: Analyzing trace with hash -642215500, now seen corresponding path program 1 times [2019-11-28 18:24:12,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:12,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727898558] [2019-11-28 18:24:12,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:24:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:24:12,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:24:12,181 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:24:12,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_155) (= v_~y~0_275 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30|) |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_865 0) (= 0 v_~y$w_buff0~0_221) (= v_~y$w_buff1~0_203 0) (= v_~y$r_buff0_thd0~0_374 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_30|) (= v_~y$r_buff1_thd0~0_352 0) (= v_~__unbuffered_p1_EBX~0_37 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_30| 4)) (= v_~y$mem_tmp~0_168 0) (= v_~y$w_buff1_used~0_515 0) (= 0 v_~y$r_buff1_thd2~0_343) (= 0 v_~__unbuffered_p1_EAX~0_60) (= 0 v_~y$r_buff0_thd2~0_460) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_236 0) (= v_~main$tmp_guard0~0_33 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30|) 0) (= v_~y$r_buff0_thd1~0_98 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_cnt~0_42) (= |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30| 1)) (= v_~main$tmp_guard1~0_40 0) (= v_~y$flush_delayed~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_125|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_59|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_33|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_155, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_83|, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_460, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~x~0=v_~x~0_25, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_865, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_22|, ~y$w_buff0~0=v_~y$w_buff0~0_221, ~y~0=v_~y~0_275, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_37, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_30|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_22|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_343, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_162|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:12,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-11-28 18:24:12,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~y$w_buff0_used~0_156 1) (= v_~y$w_buff0~0_36 v_~y$w_buff1~0_27) (= 2 v_~y$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_156 256))) (not (= 0 (mod v_~y$w_buff1_used~0_77 256))))) 1 0)) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_77 v_~y$w_buff0_used~0_157)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_27, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:12,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1183035700 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1183035700 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite11_Out1183035700| |P1Thread1of1ForFork1_#t~ite12_Out1183035700|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1183035700| ~y$w_buff0~0_In1183035700) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1183035700| ~y$w_buff1~0_In1183035700) (or .cse0 .cse2) .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1183035700, ~y$w_buff1~0=~y$w_buff1~0_In1183035700, ~y$w_buff0~0=~y$w_buff0~0_In1183035700, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1183035700} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1183035700, ~y$w_buff1~0=~y$w_buff1~0_In1183035700, ~y$w_buff0~0=~y$w_buff0~0_In1183035700, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1183035700, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1183035700|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1183035700|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:24:12,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_138 v_~y$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:24:12,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1135544780 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out-1135544780| ~y$mem_tmp~0_In-1135544780)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out-1135544780| ~y~0_In-1135544780)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1135544780, ~y$flush_delayed~0=~y$flush_delayed~0_In-1135544780, ~y~0=~y~0_In-1135544780} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1135544780, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1135544780|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1135544780, ~y~0=~y~0_In-1135544780} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:24:12,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-2122933032 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-2122933032 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-2122933032| |P0Thread1of1ForFork0_#t~ite3_Out-2122933032|))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-2122933032| ~y$w_buff1~0_In-2122933032) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-2122933032| ~y~0_In-2122933032) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2122933032, ~y$w_buff1~0=~y$w_buff1~0_In-2122933032, ~y~0=~y~0_In-2122933032, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2122933032} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2122933032, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-2122933032|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-2122933032|, ~y$w_buff1~0=~y$w_buff1~0_In-2122933032, ~y~0=~y~0_In-2122933032, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2122933032} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:24:12,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-730887384 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-730887384 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-730887384|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-730887384 |P0Thread1of1ForFork0_#t~ite5_Out-730887384|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-730887384, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-730887384} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-730887384|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-730887384, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-730887384} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:24:12,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-840404583 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-840404583 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-840404583 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-840404583 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-840404583| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-840404583 |P0Thread1of1ForFork0_#t~ite6_Out-840404583|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-840404583, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-840404583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-840404583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840404583} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-840404583|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-840404583, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-840404583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-840404583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840404583} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:24:12,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1882486903 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1882486903 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1882486903| 0)) (and (= ~y$r_buff0_thd1~0_In1882486903 |P0Thread1of1ForFork0_#t~ite7_Out1882486903|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1882486903, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1882486903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1882486903, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1882486903|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1882486903} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:24:12,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1657556849 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1657556849 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1657556849 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1657556849 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1657556849|)) (and (= ~y$r_buff1_thd1~0_In-1657556849 |P0Thread1of1ForFork0_#t~ite8_Out-1657556849|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1657556849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1657556849, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1657556849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1657556849} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1657556849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1657556849, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1657556849|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1657556849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1657556849} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:24:12,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_141 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:24:12,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1687104176 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1687104176 256)))) (or (and (= ~y$w_buff0_used~0_In-1687104176 |P1Thread1of1ForFork1_#t~ite34_Out-1687104176|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1687104176| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1687104176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1687104176} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1687104176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1687104176, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1687104176|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:24:12,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1445113025 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1445113025 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1445113025 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1445113025 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1445113025| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1445113025| ~y$w_buff1_used~0_In-1445113025) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1445113025, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1445113025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1445113025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1445113025} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1445113025, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1445113025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1445113025, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1445113025|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1445113025} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:24:12,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1460206089 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1460206089 256))) (.cse2 (= ~y$r_buff0_thd2~0_In1460206089 ~y$r_buff0_thd2~0_Out1460206089))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out1460206089) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1460206089, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1460206089} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1460206089, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1460206089, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1460206089|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:24:12,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1056807864 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1056807864 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1056807864 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1056807864 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1056807864|)) (and (= ~y$r_buff1_thd2~0_In1056807864 |P1Thread1of1ForFork1_#t~ite37_Out1056807864|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1056807864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1056807864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1056807864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1056807864} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1056807864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1056807864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1056807864, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1056807864|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1056807864} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:24:12,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y$r_buff1_thd2~0_155 |v_P1Thread1of1ForFork1_#t~ite37_20|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:24:12,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_55 256)) (= (mod v_~y$w_buff0_used~0_124 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:24:12,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-947141435 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-947141435 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-947141435| ~y~0_In-947141435)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-947141435| ~y$w_buff1~0_In-947141435) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-947141435, ~y~0=~y~0_In-947141435, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-947141435, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-947141435} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-947141435|, ~y$w_buff1~0=~y$w_buff1~0_In-947141435, ~y~0=~y~0_In-947141435, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-947141435, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-947141435} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:24:12,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_55 |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_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:24:12,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2014944432 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2014944432 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2014944432| ~y$w_buff0_used~0_In2014944432)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2014944432| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2014944432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2014944432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2014944432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2014944432, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2014944432|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:24:12,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-183550101 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-183550101 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-183550101 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-183550101 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-183550101|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-183550101 |ULTIMATE.start_main_#t~ite43_Out-183550101|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-183550101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-183550101, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-183550101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-183550101} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-183550101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-183550101, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-183550101|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-183550101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-183550101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:24:12,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-532142518 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-532142518 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-532142518| ~y$r_buff0_thd0~0_In-532142518)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-532142518| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-532142518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-532142518} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-532142518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-532142518, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-532142518|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:24:12,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1900926849 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1900926849 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1900926849 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1900926849 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1900926849| ~y$r_buff1_thd0~0_In1900926849) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1900926849| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1900926849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1900926849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1900926849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1900926849} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1900926849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1900926849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1900926849, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1900926849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1900926849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:24:12,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In986749145 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out986749145| ~y$mem_tmp~0_In986749145) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite68_Out986749145| ~y~0_In986749145) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In986749145, ~y$flush_delayed~0=~y$flush_delayed~0_In986749145, ~y~0=~y~0_In986749145} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In986749145, ~y$flush_delayed~0=~y$flush_delayed~0_In986749145, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out986749145|, ~y~0=~y~0_In986749145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-11-28 18:24:12,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_262 |v_ULTIMATE.start_main_#t~ite68_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_189 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ~y~0=v_~y~0_262, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:24:12,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:24:12 BasicIcfg [2019-11-28 18:24:12,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:24:12,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:24:12,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:24:12,319 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:24:12,319 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:43" (3/4) ... [2019-11-28 18:24:12,323 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:24:12,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_155) (= v_~y~0_275 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30|) |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_865 0) (= 0 v_~y$w_buff0~0_221) (= v_~y$w_buff1~0_203 0) (= v_~y$r_buff0_thd0~0_374 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_30|) (= v_~y$r_buff1_thd0~0_352 0) (= v_~__unbuffered_p1_EBX~0_37 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_30| 4)) (= v_~y$mem_tmp~0_168 0) (= v_~y$w_buff1_used~0_515 0) (= 0 v_~y$r_buff1_thd2~0_343) (= 0 v_~__unbuffered_p1_EAX~0_60) (= 0 v_~y$r_buff0_thd2~0_460) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_236 0) (= v_~main$tmp_guard0~0_33 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30|) 0) (= v_~y$r_buff0_thd1~0_98 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_cnt~0_42) (= |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30| 1)) (= v_~main$tmp_guard1~0_40 0) (= v_~y$flush_delayed~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_125|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_59|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_33|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_155, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_83|, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_460, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~x~0=v_~x~0_25, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_865, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_22|, ~y$w_buff0~0=v_~y$w_buff0~0_221, ~y~0=v_~y~0_275, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_37, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_30|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_22|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_343, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_162|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:12,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-11-28 18:24:12,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~y$w_buff0_used~0_156 1) (= v_~y$w_buff0~0_36 v_~y$w_buff1~0_27) (= 2 v_~y$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_156 256))) (not (= 0 (mod v_~y$w_buff1_used~0_77 256))))) 1 0)) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_77 v_~y$w_buff0_used~0_157)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_27, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:12,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1183035700 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1183035700 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite11_Out1183035700| |P1Thread1of1ForFork1_#t~ite12_Out1183035700|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1183035700| ~y$w_buff0~0_In1183035700) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1183035700| ~y$w_buff1~0_In1183035700) (or .cse0 .cse2) .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1183035700, ~y$w_buff1~0=~y$w_buff1~0_In1183035700, ~y$w_buff0~0=~y$w_buff0~0_In1183035700, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1183035700} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1183035700, ~y$w_buff1~0=~y$w_buff1~0_In1183035700, ~y$w_buff0~0=~y$w_buff0~0_In1183035700, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1183035700, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1183035700|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1183035700|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:24:12,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_138 v_~y$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:24:12,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1135544780 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out-1135544780| ~y$mem_tmp~0_In-1135544780)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out-1135544780| ~y~0_In-1135544780)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1135544780, ~y$flush_delayed~0=~y$flush_delayed~0_In-1135544780, ~y~0=~y~0_In-1135544780} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1135544780, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1135544780|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1135544780, ~y~0=~y~0_In-1135544780} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:24:12,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-2122933032 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-2122933032 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-2122933032| |P0Thread1of1ForFork0_#t~ite3_Out-2122933032|))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-2122933032| ~y$w_buff1~0_In-2122933032) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-2122933032| ~y~0_In-2122933032) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2122933032, ~y$w_buff1~0=~y$w_buff1~0_In-2122933032, ~y~0=~y~0_In-2122933032, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2122933032} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2122933032, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-2122933032|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-2122933032|, ~y$w_buff1~0=~y$w_buff1~0_In-2122933032, ~y~0=~y~0_In-2122933032, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2122933032} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:24:12,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-730887384 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-730887384 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-730887384|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-730887384 |P0Thread1of1ForFork0_#t~ite5_Out-730887384|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-730887384, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-730887384} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-730887384|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-730887384, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-730887384} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:24:12,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-840404583 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-840404583 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-840404583 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-840404583 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-840404583| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-840404583 |P0Thread1of1ForFork0_#t~ite6_Out-840404583|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-840404583, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-840404583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-840404583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840404583} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-840404583|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-840404583, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-840404583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-840404583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840404583} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:24:12,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1882486903 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1882486903 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1882486903| 0)) (and (= ~y$r_buff0_thd1~0_In1882486903 |P0Thread1of1ForFork0_#t~ite7_Out1882486903|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1882486903, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1882486903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1882486903, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1882486903|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1882486903} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:24:12,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1657556849 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1657556849 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1657556849 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1657556849 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1657556849|)) (and (= ~y$r_buff1_thd1~0_In-1657556849 |P0Thread1of1ForFork0_#t~ite8_Out-1657556849|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1657556849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1657556849, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1657556849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1657556849} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1657556849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1657556849, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1657556849|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1657556849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1657556849} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:24:12,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_141 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:24:12,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1687104176 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1687104176 256)))) (or (and (= ~y$w_buff0_used~0_In-1687104176 |P1Thread1of1ForFork1_#t~ite34_Out-1687104176|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1687104176| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1687104176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1687104176} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1687104176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1687104176, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1687104176|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:24:12,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1445113025 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1445113025 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1445113025 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1445113025 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1445113025| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1445113025| ~y$w_buff1_used~0_In-1445113025) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1445113025, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1445113025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1445113025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1445113025} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1445113025, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1445113025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1445113025, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1445113025|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1445113025} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:24:12,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1460206089 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1460206089 256))) (.cse2 (= ~y$r_buff0_thd2~0_In1460206089 ~y$r_buff0_thd2~0_Out1460206089))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out1460206089) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1460206089, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1460206089} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1460206089, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1460206089, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1460206089|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:24:12,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1056807864 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1056807864 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1056807864 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1056807864 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1056807864|)) (and (= ~y$r_buff1_thd2~0_In1056807864 |P1Thread1of1ForFork1_#t~ite37_Out1056807864|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1056807864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1056807864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1056807864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1056807864} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1056807864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1056807864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1056807864, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1056807864|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1056807864} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:24:12,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y$r_buff1_thd2~0_155 |v_P1Thread1of1ForFork1_#t~ite37_20|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:24:12,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_55 256)) (= (mod v_~y$w_buff0_used~0_124 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:24:12,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-947141435 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-947141435 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-947141435| ~y~0_In-947141435)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-947141435| ~y$w_buff1~0_In-947141435) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-947141435, ~y~0=~y~0_In-947141435, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-947141435, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-947141435} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-947141435|, ~y$w_buff1~0=~y$w_buff1~0_In-947141435, ~y~0=~y~0_In-947141435, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-947141435, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-947141435} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:24:12,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_55 |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_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:24:12,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2014944432 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2014944432 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2014944432| ~y$w_buff0_used~0_In2014944432)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2014944432| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2014944432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2014944432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2014944432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2014944432, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2014944432|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:24:12,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-183550101 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-183550101 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-183550101 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-183550101 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-183550101|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-183550101 |ULTIMATE.start_main_#t~ite43_Out-183550101|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-183550101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-183550101, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-183550101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-183550101} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-183550101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-183550101, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-183550101|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-183550101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-183550101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:24:12,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-532142518 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-532142518 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-532142518| ~y$r_buff0_thd0~0_In-532142518)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-532142518| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-532142518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-532142518} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-532142518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-532142518, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-532142518|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:24:12,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1900926849 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1900926849 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1900926849 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1900926849 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1900926849| ~y$r_buff1_thd0~0_In1900926849) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1900926849| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1900926849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1900926849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1900926849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1900926849} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1900926849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1900926849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1900926849, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1900926849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1900926849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:24:12,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In986749145 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out986749145| ~y$mem_tmp~0_In986749145) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite68_Out986749145| ~y~0_In986749145) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In986749145, ~y$flush_delayed~0=~y$flush_delayed~0_In986749145, ~y~0=~y~0_In986749145} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In986749145, ~y$flush_delayed~0=~y$flush_delayed~0_In986749145, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out986749145|, ~y~0=~y~0_In986749145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-11-28 18:24:12,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_262 |v_ULTIMATE.start_main_#t~ite68_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_189 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ~y~0=v_~y~0_262, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:24:12,544 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:24:12,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:24:12,546 INFO L168 Benchmark]: Toolchain (without parser) took 30409.77 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 951.0 MB in the beginning and 993.3 MB in the end (delta: -42.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-28 18:24:12,547 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:24:12,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:12,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.93 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:24:12,548 INFO L168 Benchmark]: Boogie Preprocessor took 45.67 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:24:12,549 INFO L168 Benchmark]: RCFGBuilder took 920.24 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: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:12,550 INFO L168 Benchmark]: TraceAbstraction took 28357.73 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -11.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-28 18:24:12,551 INFO L168 Benchmark]: Witness Printer took 226.51 ms. Allocated memory is still 2.5 GB. Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:12,553 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.88 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 779.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.93 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. * Boogie Preprocessor took 45.67 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. * RCFGBuilder took 920.24 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: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28357.73 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -11.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 226.51 ms. Allocated memory is still 2.5 GB. Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 55 ConcurrentYvCompositions, 33 ChoiceCompositions, 10314 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 142511 CheckedPairsTotal, 117 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(&t1719, ((void *)0), P0, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t1720, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y 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=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) 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=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) 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=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 x = 1 [L727] 1 y = 1 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=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [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=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 y$flush_delayed = weak$$choice2 [L815] 0 y$mem_tmp = y 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3707 SDtfs, 3296 SDslu, 8471 SDs, 0 SdLazy, 5167 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 38 SyntacticMatches, 20 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 26048 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 931 NumberOfCodeBlocks, 931 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 179617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...