/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:50:17,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:50:17,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:50:17,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:50:17,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:50:17,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:50:17,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:50:17,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:50:17,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:50:17,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:50:17,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:50:17,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:50:17,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:50:17,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:50:17,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:50:17,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:50:17,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:50:17,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:50:17,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:50:17,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:50:17,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:50:17,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:50:17,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:50:17,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:50:17,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:50:17,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:50:17,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:50:17,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:50:17,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:50:17,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:50:17,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:50:17,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:50:17,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:50:17,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:50:17,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:50:17,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:50:17,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:50:17,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:50:17,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:50:17,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:50:17,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:50:17,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:50:17,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:50:17,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:50:17,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:50:17,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:50:17,993 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:50:17,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:50:17,993 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:50:17,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:50:17,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:50:17,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:50:17,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:50:17,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:50:17,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:50:17,994 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:50:17,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:50:17,995 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:50:17,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:50:17,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:50:17,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:50:17,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:50:17,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:50:17,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:50:17,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:50:17,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:50:17,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:50:17,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:50:17,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:50:17,997 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:50:17,997 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:50:17,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:50:17,998 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:50:17,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:50:18,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:50:18,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:50:18,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:50:18,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:50:18,318 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:50:18,319 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-27 21:50:18,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a929b9ba/ad39481c37e24607af7710ef50918d9c/FLAG0adc52232 [2019-12-27 21:50:18,912 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:50:18,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-27 21:50:18,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a929b9ba/ad39481c37e24607af7710ef50918d9c/FLAG0adc52232 [2019-12-27 21:50:19,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a929b9ba/ad39481c37e24607af7710ef50918d9c [2019-12-27 21:50:19,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:50:19,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:50:19,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:19,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:50:19,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:50:19,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:19" (1/1) ... [2019-12-27 21:50:19,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0f289a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:19, skipping insertion in model container [2019-12-27 21:50:19,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:19" (1/1) ... [2019-12-27 21:50:19,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:50:19,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:50:19,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:19,893 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:50:19,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:20,050 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:50:20,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20 WrapperNode [2019-12-27 21:50:20,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:20,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:20,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:50:20,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:50:20,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:20,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:50:20,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:50:20,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:50:20,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (1/1) ... [2019-12-27 21:50:20,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:50:20,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:50:20,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:50:20,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:50:20,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (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-12-27 21:50:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:50:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:50:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:50:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:50:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:50:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:50:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:50:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:50:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:50:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:50:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:50:20,255 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:50:20,915 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:50:20,915 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:50:20,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:20 BoogieIcfgContainer [2019-12-27 21:50:20,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:50:20,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:50:20,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:50:20,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:50:20,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:50:19" (1/3) ... [2019-12-27 21:50:20,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3640d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:20, skipping insertion in model container [2019-12-27 21:50:20,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:20" (2/3) ... [2019-12-27 21:50:20,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3640d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:20, skipping insertion in model container [2019-12-27 21:50:20,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:20" (3/3) ... [2019-12-27 21:50:20,926 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt.i [2019-12-27 21:50:20,937 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:50:20,938 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:50:20,947 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:50:20,948 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:50:20,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:20,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,021 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,027 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,028 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,028 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:21,048 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:50:21,066 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:50:21,067 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:50:21,067 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:50:21,067 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:50:21,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:50:21,067 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:50:21,067 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:50:21,068 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:50:21,085 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 21:50:21,087 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:50:21,192 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:50:21,192 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:21,205 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:50:21,221 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:50:21,266 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:50:21,266 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:21,272 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:50:21,285 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 21:50:21,286 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:50:24,262 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:50:24,369 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:50:24,386 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49437 [2019-12-27 21:50:24,386 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 21:50:24,390 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 21:50:24,965 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9388 states. [2019-12-27 21:50:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states. [2019-12-27 21:50:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:50:24,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:24,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:50:24,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:24,982 INFO L82 PathProgramCache]: Analyzing trace with hash 694837997, now seen corresponding path program 1 times [2019-12-27 21:50:24,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:24,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076024063] [2019-12-27 21:50:24,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:25,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076024063] [2019-12-27 21:50:25,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:25,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:50:25,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795875276] [2019-12-27 21:50:25,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:25,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:25,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:50:25,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:25,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:25,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:25,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:25,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:25,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:25,248 INFO L87 Difference]: Start difference. First operand 9388 states. Second operand 3 states. [2019-12-27 21:50:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:25,640 INFO L93 Difference]: Finished difference Result 9298 states and 30527 transitions. [2019-12-27 21:50:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:25,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:50:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:25,760 INFO L225 Difference]: With dead ends: 9298 [2019-12-27 21:50:25,760 INFO L226 Difference]: Without dead ends: 9116 [2019-12-27 21:50:25,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9116 states. [2019-12-27 21:50:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9116 to 9116. [2019-12-27 21:50:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-27 21:50:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29968 transitions. [2019-12-27 21:50:26,244 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29968 transitions. Word has length 5 [2019-12-27 21:50:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:26,245 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29968 transitions. [2019-12-27 21:50:26,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29968 transitions. [2019-12-27 21:50:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:50:26,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:26,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:26,248 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -869232034, now seen corresponding path program 1 times [2019-12-27 21:50:26,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:26,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529996505] [2019-12-27 21:50:26,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:26,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529996505] [2019-12-27 21:50:26,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:26,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:26,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424243100] [2019-12-27 21:50:26,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:26,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:26,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:50:26,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:26,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:50:26,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:26,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:26,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:26,513 INFO L87 Difference]: Start difference. First operand 9116 states and 29968 transitions. Second operand 5 states. [2019-12-27 21:50:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:26,987 INFO L93 Difference]: Finished difference Result 14491 states and 45326 transitions. [2019-12-27 21:50:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:26,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:50:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:27,090 INFO L225 Difference]: With dead ends: 14491 [2019-12-27 21:50:27,091 INFO L226 Difference]: Without dead ends: 14484 [2019-12-27 21:50:27,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:50:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2019-12-27 21:50:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 13090. [2019-12-27 21:50:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-27 21:50:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41590 transitions. [2019-12-27 21:50:28,233 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41590 transitions. Word has length 11 [2019-12-27 21:50:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:28,233 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41590 transitions. [2019-12-27 21:50:28,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41590 transitions. [2019-12-27 21:50:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:50:28,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:28,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:28,242 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash 256873832, now seen corresponding path program 1 times [2019-12-27 21:50:28,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:28,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557389128] [2019-12-27 21:50:28,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:28,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557389128] [2019-12-27 21:50:28,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:28,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:28,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [491740109] [2019-12-27 21:50:28,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:28,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:28,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:50:28,367 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:28,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:28,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:50:28,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:50:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:50:28,368 INFO L87 Difference]: Start difference. First operand 13090 states and 41590 transitions. Second operand 4 states. [2019-12-27 21:50:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:28,648 INFO L93 Difference]: Finished difference Result 15862 states and 50069 transitions. [2019-12-27 21:50:28,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:28,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:50:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:28,702 INFO L225 Difference]: With dead ends: 15862 [2019-12-27 21:50:28,702 INFO L226 Difference]: Without dead ends: 15862 [2019-12-27 21:50:28,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15862 states. [2019-12-27 21:50:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15862 to 14086. [2019-12-27 21:50:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14086 states. [2019-12-27 21:50:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 44814 transitions. [2019-12-27 21:50:29,307 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 44814 transitions. Word has length 11 [2019-12-27 21:50:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:29,307 INFO L462 AbstractCegarLoop]: Abstraction has 14086 states and 44814 transitions. [2019-12-27 21:50:29,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:50:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 44814 transitions. [2019-12-27 21:50:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:50:29,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:29,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:29,312 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash -955684775, now seen corresponding path program 1 times [2019-12-27 21:50:29,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:29,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134285533] [2019-12-27 21:50:29,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:29,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134285533] [2019-12-27 21:50:29,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:29,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:29,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [586284347] [2019-12-27 21:50:29,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:29,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:29,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 49 transitions. [2019-12-27 21:50:29,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:29,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:29,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:29,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:29,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:29,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:29,405 INFO L87 Difference]: Start difference. First operand 14086 states and 44814 transitions. Second operand 5 states. [2019-12-27 21:50:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:29,871 INFO L93 Difference]: Finished difference Result 18942 states and 58832 transitions. [2019-12-27 21:50:29,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:50:29,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 21:50:29,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:29,926 INFO L225 Difference]: With dead ends: 18942 [2019-12-27 21:50:29,926 INFO L226 Difference]: Without dead ends: 18935 [2019-12-27 21:50:29,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:50:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18935 states. [2019-12-27 21:50:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18935 to 13974. [2019-12-27 21:50:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13974 states. [2019-12-27 21:50:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13974 states to 13974 states and 44317 transitions. [2019-12-27 21:50:30,587 INFO L78 Accepts]: Start accepts. Automaton has 13974 states and 44317 transitions. Word has length 17 [2019-12-27 21:50:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:30,587 INFO L462 AbstractCegarLoop]: Abstraction has 13974 states and 44317 transitions. [2019-12-27 21:50:30,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 13974 states and 44317 transitions. [2019-12-27 21:50:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:50:30,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:30,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:30,600 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1822059607, now seen corresponding path program 1 times [2019-12-27 21:50:30,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:30,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403317656] [2019-12-27 21:50:30,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:30,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403317656] [2019-12-27 21:50:30,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:30,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:30,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [288472379] [2019-12-27 21:50:30,648 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:30,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:30,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:50:30,657 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:30,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:30,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:30,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:30,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:30,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:30,659 INFO L87 Difference]: Start difference. First operand 13974 states and 44317 transitions. Second operand 3 states. [2019-12-27 21:50:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:30,773 INFO L93 Difference]: Finished difference Result 17027 states and 54294 transitions. [2019-12-27 21:50:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:30,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 21:50:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:30,808 INFO L225 Difference]: With dead ends: 17027 [2019-12-27 21:50:30,809 INFO L226 Difference]: Without dead ends: 17027 [2019-12-27 21:50:30,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17027 states. [2019-12-27 21:50:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17027 to 16072. [2019-12-27 21:50:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16072 states. [2019-12-27 21:50:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 51443 transitions. [2019-12-27 21:50:31,961 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 51443 transitions. Word has length 25 [2019-12-27 21:50:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:31,962 INFO L462 AbstractCegarLoop]: Abstraction has 16072 states and 51443 transitions. [2019-12-27 21:50:31,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 51443 transitions. [2019-12-27 21:50:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:50:31,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:31,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:31,977 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:31,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1659519911, now seen corresponding path program 1 times [2019-12-27 21:50:31,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:31,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472234110] [2019-12-27 21:50:31,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:32,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472234110] [2019-12-27 21:50:32,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:32,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:32,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474264570] [2019-12-27 21:50:32,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:32,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:32,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:50:32,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:32,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:32,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:50:32,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:50:32,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:50:32,097 INFO L87 Difference]: Start difference. First operand 16072 states and 51443 transitions. Second operand 4 states. [2019-12-27 21:50:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:32,144 INFO L93 Difference]: Finished difference Result 2493 states and 5802 transitions. [2019-12-27 21:50:32,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:50:32,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 21:50:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:32,149 INFO L225 Difference]: With dead ends: 2493 [2019-12-27 21:50:32,149 INFO L226 Difference]: Without dead ends: 2207 [2019-12-27 21:50:32,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-12-27 21:50:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-12-27 21:50:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-12-27 21:50:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 5011 transitions. [2019-12-27 21:50:32,188 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 5011 transitions. Word has length 25 [2019-12-27 21:50:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:32,191 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 5011 transitions. [2019-12-27 21:50:32,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:50:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 5011 transitions. [2019-12-27 21:50:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 21:50:32,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:32,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:32,195 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1180281911, now seen corresponding path program 1 times [2019-12-27 21:50:32,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:32,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731048884] [2019-12-27 21:50:32,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:32,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731048884] [2019-12-27 21:50:32,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:32,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:50:32,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796019467] [2019-12-27 21:50:32,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:32,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:32,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 21:50:32,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:32,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:50:32,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:50:32,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:32,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:50:32,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:50:32,387 INFO L87 Difference]: Start difference. First operand 2207 states and 5011 transitions. Second operand 6 states. [2019-12-27 21:50:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:32,432 INFO L93 Difference]: Finished difference Result 431 states and 787 transitions. [2019-12-27 21:50:32,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:32,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 21:50:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:32,434 INFO L225 Difference]: With dead ends: 431 [2019-12-27 21:50:32,434 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 21:50:32,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:50:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 21:50:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 350. [2019-12-27 21:50:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 21:50:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 632 transitions. [2019-12-27 21:50:32,443 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 632 transitions. Word has length 37 [2019-12-27 21:50:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:32,443 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 632 transitions. [2019-12-27 21:50:32,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:50:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2019-12-27 21:50:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:50:32,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:32,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:32,448 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1601104520, now seen corresponding path program 1 times [2019-12-27 21:50:32,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:32,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558334255] [2019-12-27 21:50:32,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:32,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558334255] [2019-12-27 21:50:32,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:32,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:32,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1642373373] [2019-12-27 21:50:32,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:32,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:32,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 21:50:32,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:32,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:32,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:32,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:32,717 INFO L87 Difference]: Start difference. First operand 350 states and 632 transitions. Second operand 3 states. [2019-12-27 21:50:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:32,729 INFO L93 Difference]: Finished difference Result 350 states and 619 transitions. [2019-12-27 21:50:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:32,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:50:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:32,731 INFO L225 Difference]: With dead ends: 350 [2019-12-27 21:50:32,731 INFO L226 Difference]: Without dead ends: 350 [2019-12-27 21:50:32,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-27 21:50:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-12-27 21:50:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 21:50:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 619 transitions. [2019-12-27 21:50:32,737 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 619 transitions. Word has length 52 [2019-12-27 21:50:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:32,737 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 619 transitions. [2019-12-27 21:50:32,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 619 transitions. [2019-12-27 21:50:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:50:32,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:32,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:32,739 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1092657509, now seen corresponding path program 1 times [2019-12-27 21:50:32,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:32,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481819765] [2019-12-27 21:50:32,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:33,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481819765] [2019-12-27 21:50:33,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:33,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:50:33,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1272183616] [2019-12-27 21:50:33,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:33,265 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:33,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 21:50:33,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:33,453 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:50:33,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:50:33,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:50:33,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:50:33,454 INFO L87 Difference]: Start difference. First operand 350 states and 619 transitions. Second operand 15 states. [2019-12-27 21:50:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:35,406 INFO L93 Difference]: Finished difference Result 794 states and 1400 transitions. [2019-12-27 21:50:35,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:50:35,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2019-12-27 21:50:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:35,408 INFO L225 Difference]: With dead ends: 794 [2019-12-27 21:50:35,408 INFO L226 Difference]: Without dead ends: 794 [2019-12-27 21:50:35,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 21:50:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-12-27 21:50:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 472. [2019-12-27 21:50:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-27 21:50:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 848 transitions. [2019-12-27 21:50:35,419 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 848 transitions. Word has length 53 [2019-12-27 21:50:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:35,420 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 848 transitions. [2019-12-27 21:50:35,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:50:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 848 transitions. [2019-12-27 21:50:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:50:35,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:35,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:35,422 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:35,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1194206821, now seen corresponding path program 2 times [2019-12-27 21:50:35,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:35,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917023696] [2019-12-27 21:50:35,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:35,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917023696] [2019-12-27 21:50:35,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:35,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:35,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031087632] [2019-12-27 21:50:35,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:35,545 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:35,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 92 transitions. [2019-12-27 21:50:35,578 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:35,578 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:35,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:35,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:35,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:35,579 INFO L87 Difference]: Start difference. First operand 472 states and 848 transitions. Second operand 3 states. [2019-12-27 21:50:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:35,622 INFO L93 Difference]: Finished difference Result 471 states and 846 transitions. [2019-12-27 21:50:35,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:35,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:50:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:35,624 INFO L225 Difference]: With dead ends: 471 [2019-12-27 21:50:35,624 INFO L226 Difference]: Without dead ends: 471 [2019-12-27 21:50:35,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-27 21:50:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 371. [2019-12-27 21:50:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-12-27 21:50:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 658 transitions. [2019-12-27 21:50:35,631 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 658 transitions. Word has length 53 [2019-12-27 21:50:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:35,631 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 658 transitions. [2019-12-27 21:50:35,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 658 transitions. [2019-12-27 21:50:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:50:35,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:35,633 INFO L411 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] [2019-12-27 21:50:35,633 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash 36779083, now seen corresponding path program 1 times [2019-12-27 21:50:35,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:35,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503224808] [2019-12-27 21:50:35,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:35,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503224808] [2019-12-27 21:50:35,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:35,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:50:35,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282541250] [2019-12-27 21:50:35,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:35,798 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:35,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 119 transitions. [2019-12-27 21:50:35,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:35,840 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:50:35,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:50:35,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:50:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:50:35,841 INFO L87 Difference]: Start difference. First operand 371 states and 658 transitions. Second operand 6 states. [2019-12-27 21:50:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:35,900 INFO L93 Difference]: Finished difference Result 562 states and 999 transitions. [2019-12-27 21:50:35,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:50:35,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 21:50:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:35,902 INFO L225 Difference]: With dead ends: 562 [2019-12-27 21:50:35,902 INFO L226 Difference]: Without dead ends: 210 [2019-12-27 21:50:35,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:50:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-12-27 21:50:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-12-27 21:50:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-27 21:50:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-12-27 21:50:35,906 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 54 [2019-12-27 21:50:35,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:35,906 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-12-27 21:50:35,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:50:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-12-27 21:50:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:50:35,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:35,908 INFO L411 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] [2019-12-27 21:50:35,908 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash -655778997, now seen corresponding path program 2 times [2019-12-27 21:50:35,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:35,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066841303] [2019-12-27 21:50:35,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:50:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:50:36,043 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:50:36,043 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:50:36,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_cnt~0_15) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1607~0.base_19| 4) |v_#length_15|) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd1~0_19 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_32) (= (store .cse0 |v_ULTIMATE.start_main_~#t1607~0.base_19| 1) |v_#valid_40|) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1607~0.base_19|) (= 0 v_~y$r_buff1_thd0~0_46) (= v_~y$mem_tmp~0_11 0) (= v_~y~0_28 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd0~0_78 0) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$w_buff0_used~0_106 0) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1607~0.offset_14| 0) (= 0 v_~z~0_9) (= v_~y$w_buff1_used~0_64 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1607~0.base_19|) 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1607~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1607~0.base_19|) |v_ULTIMATE.start_main_~#t1607~0.offset_14| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ULTIMATE.start_main_~#t1608~0.offset=|v_ULTIMATE.start_main_~#t1608~0.offset_13|, ULTIMATE.start_main_~#t1608~0.base=|v_ULTIMATE.start_main_~#t1608~0.base_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_19, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_~#t1607~0.offset=|v_ULTIMATE.start_main_~#t1607~0.offset_14|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~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_26, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_46, ~x~0=v_~x~0_9, ~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_106, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y~0=v_~y~0_28, ULTIMATE.start_main_~#t1607~0.base=|v_ULTIMATE.start_main_~#t1607~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_78, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1608~0.offset, ULTIMATE.start_main_~#t1608~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1607~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1607~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:50:36,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L789-1-->L791: Formula: (and (= |v_ULTIMATE.start_main_~#t1608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1608~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1608~0.base_11| 1) |v_#valid_23|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1608~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1608~0.base_11|) |v_ULTIMATE.start_main_~#t1608~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1608~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1608~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1608~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1608~0.offset=|v_ULTIMATE.start_main_~#t1608~0.offset_10|, ULTIMATE.start_main_~#t1608~0.base=|v_ULTIMATE.start_main_~#t1608~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1608~0.offset, ULTIMATE.start_main_~#t1608~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:50:36,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~y$w_buff0_used~0_73) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= 2 v_~y$w_buff0~0_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} 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_73, ~y$w_buff1~0=v_~y$w_buff1~0_15, 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_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} 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-12-27 21:50:36,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1754189728 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1754189728 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1754189728| |P0Thread1of1ForFork0_#t~ite3_Out-1754189728|))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-1754189728| ~y~0_In-1754189728) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1754189728| ~y$w_buff1~0_In-1754189728) (not .cse0) (not .cse1) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1754189728, ~y$w_buff1~0=~y$w_buff1~0_In-1754189728, ~y~0=~y~0_In-1754189728, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1754189728} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1754189728, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1754189728|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1754189728|, ~y$w_buff1~0=~y$w_buff1~0_In-1754189728, ~y~0=~y~0_In-1754189728, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1754189728} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:50:36,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-509476926 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-509476926 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-509476926| ~y$w_buff0_used~0_In-509476926) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-509476926| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-509476926, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-509476926} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-509476926|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-509476926, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-509476926} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:50:36,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In2038416204 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2038416204 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In2038416204 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2038416204 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2038416204 |P0Thread1of1ForFork0_#t~ite6_Out2038416204|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2038416204|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2038416204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2038416204, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2038416204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2038416204} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2038416204|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2038416204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2038416204, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2038416204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2038416204} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:50:36,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In466469182 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In466469182 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In466469182 |P0Thread1of1ForFork0_#t~ite7_Out466469182|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out466469182|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In466469182, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In466469182} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In466469182, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out466469182|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In466469182} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:50:36,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-637576222 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-637576222 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-637576222 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-637576222 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-637576222|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In-637576222 |P0Thread1of1ForFork0_#t~ite8_Out-637576222|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-637576222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-637576222, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-637576222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-637576222} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-637576222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-637576222, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-637576222|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-637576222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-637576222} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:50:36,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} 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-12-27 21:50:36,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1955445497 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1955445497 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1955445497| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1955445497| ~y$w_buff0_used~0_In-1955445497)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955445497, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1955445497} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955445497, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1955445497, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1955445497|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:50:36,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1582402259 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1582402259 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1582402259 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1582402259 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1582402259 |P1Thread1of1ForFork1_#t~ite12_Out1582402259|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1582402259|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1582402259, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1582402259, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1582402259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1582402259} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1582402259, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1582402259, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1582402259, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1582402259|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1582402259} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:50:36,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In345342946 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In345342946 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out345342946 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_Out345342946 ~y$r_buff0_thd2~0_In345342946) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In345342946, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In345342946} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In345342946, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out345342946, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out345342946|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 21:50:36,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1999524619 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1999524619 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1999524619 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1999524619 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1999524619 |P1Thread1of1ForFork1_#t~ite14_Out-1999524619|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1999524619| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1999524619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1999524619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1999524619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1999524619} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1999524619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1999524619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1999524619, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1999524619|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1999524619} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:50:36,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:50:36,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= 0 (mod v_~y$w_buff0_used~0_94 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:50:36,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-763017744 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-763017744 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-763017744| ~y$w_buff1~0_In-763017744)) (and (= |ULTIMATE.start_main_#t~ite17_Out-763017744| ~y~0_In-763017744) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-763017744, ~y~0=~y~0_In-763017744, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-763017744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-763017744} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-763017744|, ~y$w_buff1~0=~y$w_buff1~0_In-763017744, ~y~0=~y~0_In-763017744, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-763017744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-763017744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 21:50:36,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 21:50:36,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1618600159 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1618600159 256)))) (or (and (= ~y$w_buff0_used~0_In-1618600159 |ULTIMATE.start_main_#t~ite19_Out-1618600159|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1618600159|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1618600159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1618600159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1618600159, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1618600159|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1618600159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:50:36,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In116751532 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In116751532 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In116751532 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In116751532 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out116751532| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out116751532| ~y$w_buff1_used~0_In116751532) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In116751532, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116751532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In116751532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In116751532} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In116751532, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116751532, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out116751532|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In116751532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In116751532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:50:36,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1520621237 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1520621237 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1520621237 |ULTIMATE.start_main_#t~ite21_Out-1520621237|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1520621237| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1520621237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1520621237} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1520621237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1520621237, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1520621237|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:50:36,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-779728101 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-779728101 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-779728101 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-779728101 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-779728101| ~y$r_buff1_thd0~0_In-779728101)) (and (= |ULTIMATE.start_main_#t~ite22_Out-779728101| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-779728101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-779728101, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-779728101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-779728101} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-779728101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-779728101, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-779728101, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-779728101|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-779728101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:50:36,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2102220387 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In2102220387| |ULTIMATE.start_main_#t~ite37_Out2102220387|) (= |ULTIMATE.start_main_#t~ite38_Out2102220387| ~y$w_buff1_used~0_In2102220387)) (and (= ~y$w_buff1_used~0_In2102220387 |ULTIMATE.start_main_#t~ite37_Out2102220387|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2102220387 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In2102220387 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2102220387 256))) (= (mod ~y$w_buff0_used~0_In2102220387 256) 0))) (= |ULTIMATE.start_main_#t~ite38_Out2102220387| |ULTIMATE.start_main_#t~ite37_Out2102220387|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2102220387, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2102220387, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In2102220387|, ~weak$$choice2~0=~weak$$choice2~0_In2102220387, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2102220387, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2102220387} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2102220387, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2102220387, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2102220387|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2102220387|, ~weak$$choice2~0=~weak$$choice2~0_In2102220387, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2102220387, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2102220387} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:50:36,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_20 256))) (= v_~y$r_buff0_thd0~0_56 v_~y$r_buff0_thd0~0_55)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 21:50:36,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L816-->L819-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:50:36,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:50:36,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:50:36 BasicIcfg [2019-12-27 21:50:36,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:50:36,176 INFO L168 Benchmark]: Toolchain (without parser) took 16978.94 ms. Allocated memory was 144.2 MB in the beginning and 777.0 MB in the end (delta: 632.8 MB). Free memory was 99.2 MB in the beginning and 278.8 MB in the end (delta: -179.6 MB). Peak memory consumption was 453.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:36,177 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 21:50:36,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.46 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 98.8 MB in the beginning and 157.5 MB in the end (delta: -58.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:36,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.58 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 154.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:36,179 INFO L168 Benchmark]: Boogie Preprocessor took 46.18 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:36,180 INFO L168 Benchmark]: RCFGBuilder took 737.17 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 107.8 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:36,181 INFO L168 Benchmark]: TraceAbstraction took 15256.52 ms. Allocated memory was 202.9 MB in the beginning and 777.0 MB in the end (delta: 574.1 MB). Free memory was 106.8 MB in the beginning and 278.8 MB in the end (delta: -172.0 MB). Peak memory consumption was 402.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:36,185 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.22 ms. Allocated memory is still 144.2 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.46 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 98.8 MB in the beginning and 157.5 MB in the end (delta: -58.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.58 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 154.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.18 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 737.17 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 107.8 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15256.52 ms. Allocated memory was 202.9 MB in the beginning and 777.0 MB in the end (delta: 574.1 MB). Free memory was 106.8 MB in the beginning and 278.8 MB in the end (delta: -172.0 MB). Peak memory consumption was 402.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 148 ProgramPointsBefore, 81 ProgramPointsAfterwards, 182 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3553 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49437 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1607, ((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, z=0] [L791] FCALL, FORK 0 pthread_create(&t1608, ((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, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=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, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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, z=1] [L732] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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, z=1] [L732] 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) [L766] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 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 [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 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) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 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 [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=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, z=1] [L808] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=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, z=1] [L808] 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) [L809] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=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, z=1] [L809] 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)) [L810] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=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, z=1] [L810] 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)) [L811] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=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, z=1] [L811] 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)) [L812] 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)) [L814] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=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, z=1] [L814] 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)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1265 SDtfs, 1330 SDslu, 2302 SDs, 0 SdLazy, 1642 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16072occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9543 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 43744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...