/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:31:27,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:31:27,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:31:27,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:31:27,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:31:27,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:31:27,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:31:27,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:31:27,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:31:27,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:31:27,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:31:27,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:31:27,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:31:27,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:31:27,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:31:27,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:31:27,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:31:27,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:31:27,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:31:27,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:31:27,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:31:27,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:31:27,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:31:27,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:31:27,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:31:27,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:31:27,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:31:27,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:31:27,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:31:27,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:31:27,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:31:27,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:31:27,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:31:27,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:31:27,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:31:27,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:31:27,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:31:27,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:31:27,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:31:27,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:31:27,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:31:27,986 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.epf [2019-12-18 21:31:27,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:31:28,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:31:28,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:31:28,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:31:28,001 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:31:28,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:31:28,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:31:28,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:31:28,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:31:28,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:31:28,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:31:28,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:31:28,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:31:28,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:31:28,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:31:28,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:31:28,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:31:28,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:31:28,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:31:28,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:31:28,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:31:28,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:31:28,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:31:28,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:31:28,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:31:28,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:31:28,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:31:28,006 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:31:28,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:31:28,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:31:28,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:31:28,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:31:28,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:31:28,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:31:28,302 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:31:28,303 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-18 21:31:28,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e056afd1/913611a6bbaf493691dfa04e2c710e10/FLAG1c69f7371 [2019-12-18 21:31:28,874 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:31:28,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-18 21:31:28,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e056afd1/913611a6bbaf493691dfa04e2c710e10/FLAG1c69f7371 [2019-12-18 21:31:29,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e056afd1/913611a6bbaf493691dfa04e2c710e10 [2019-12-18 21:31:29,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:31:29,224 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:31:29,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:31:29,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:31:29,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:31:29,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:31:29" (1/1) ... [2019-12-18 21:31:29,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:29, skipping insertion in model container [2019-12-18 21:31:29,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:31:29" (1/1) ... [2019-12-18 21:31:29,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:31:29,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:31:29,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:31:29,844 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:31:29,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:31:30,054 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:31:30,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30 WrapperNode [2019-12-18 21:31:30,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:31:30,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:31:30,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:31:30,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:31:30,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:31:30,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:31:30,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:31:30,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:31:30,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (1/1) ... [2019-12-18 21:31:30,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:31:30,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:31:30,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:31:30,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:31:30,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (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-18 21:31:30,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:31:30,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:31:30,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:31:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:31:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:31:30,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:31:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:31:30,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:31:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:31:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:31:30,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:31:30,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:31:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:31:30,278 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:31:31,003 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:31:31,003 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:31:31,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:31:31 BoogieIcfgContainer [2019-12-18 21:31:31,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:31:31,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:31:31,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:31:31,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:31:31,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:31:29" (1/3) ... [2019-12-18 21:31:31,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b46fabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:31:31, skipping insertion in model container [2019-12-18 21:31:31,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:30" (2/3) ... [2019-12-18 21:31:31,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b46fabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:31:31, skipping insertion in model container [2019-12-18 21:31:31,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:31:31" (3/3) ... [2019-12-18 21:31:31,014 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2019-12-18 21:31:31,024 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:31:31,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:31:31,033 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:31:31,034 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:31:31,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,093 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,094 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,095 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,096 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,096 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,109 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,111 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,116 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:31,136 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:31:31,157 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:31:31,157 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:31:31,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:31:31,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:31:31,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:31:31,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:31:31,158 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:31:31,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:31:31,176 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 21:31:31,197 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 21:31:31,274 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 21:31:31,274 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:31:31,289 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:31:31,307 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 21:31:31,347 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 21:31:31,348 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:31:31,353 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:31:31,368 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:31:31,369 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:31:34,789 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:31:34,912 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:31:34,938 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-18 21:31:34,938 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 21:31:34,942 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-18 21:31:35,882 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-18 21:31:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-18 21:31:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:31:35,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:35,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:35,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:35,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:35,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-18 21:31:35,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:35,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573661881] [2019-12-18 21:31:35,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:36,149 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-18 21:31:36,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573661881] [2019-12-18 21:31:36,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:36,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:31:36,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874849487] [2019-12-18 21:31:36,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:36,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:36,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:36,171 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-18 21:31:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:36,678 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-18 21:31:36,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:36,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:31:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:36,880 INFO L225 Difference]: With dead ends: 17518 [2019-12-18 21:31:36,881 INFO L226 Difference]: Without dead ends: 17154 [2019-12-18 21:31:36,882 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-18 21:31:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-18 21:31:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-18 21:31:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-18 21:31:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-18 21:31:38,272 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-18 21:31:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:38,273 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-18 21:31:38,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-18 21:31:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:31:38,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:38,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:38,279 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-18 21:31:38,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:38,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223618807] [2019-12-18 21:31:38,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:38,371 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-18 21:31:38,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223618807] [2019-12-18 21:31:38,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:38,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:38,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960857738] [2019-12-18 21:31:38,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:31:38,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:31:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:31:38,376 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 4 states. [2019-12-18 21:31:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:39,091 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-18 21:31:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:31:39,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:31:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:39,222 INFO L225 Difference]: With dead ends: 26570 [2019-12-18 21:31:39,222 INFO L226 Difference]: Without dead ends: 26556 [2019-12-18 21:31:39,223 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-18 21:31:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-18 21:31:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-18 21:31:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-18 21:31:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-18 21:31:40,228 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-18 21:31:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:40,229 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-18 21:31:40,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:31:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-18 21:31:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:31:40,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:40,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:40,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:40,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:40,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-18 21:31:40,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:40,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536507921] [2019-12-18 21:31:40,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:40,343 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-18 21:31:40,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536507921] [2019-12-18 21:31:40,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:40,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:40,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394831537] [2019-12-18 21:31:40,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:40,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:40,347 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-18 21:31:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:40,419 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-18 21:31:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:40,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:31:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:40,465 INFO L225 Difference]: With dead ends: 13809 [2019-12-18 21:31:40,466 INFO L226 Difference]: Without dead ends: 13809 [2019-12-18 21:31:40,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-18 21:31:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-18 21:31:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-18 21:31:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-18 21:31:41,819 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-18 21:31:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:41,822 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-18 21:31:41,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-18 21:31:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:31:41,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:41,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:41,831 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:41,832 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-18 21:31:41,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:41,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595319126] [2019-12-18 21:31:41,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:41,919 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-18 21:31:41,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595319126] [2019-12-18 21:31:41,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:41,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:31:41,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949162075] [2019-12-18 21:31:41,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:31:41,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:31:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:31:41,922 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 4 states. [2019-12-18 21:31:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:41,949 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-18 21:31:41,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:31:41,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:31:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:41,954 INFO L225 Difference]: With dead ends: 2006 [2019-12-18 21:31:41,955 INFO L226 Difference]: Without dead ends: 2006 [2019-12-18 21:31:41,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:31:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-18 21:31:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-18 21:31:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-18 21:31:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-18 21:31:41,989 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-18 21:31:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:41,990 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-18 21:31:41,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:31:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-18 21:31:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:31:41,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:41,992 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] [2019-12-18 21:31:41,993 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-18 21:31:41,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:41,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803693121] [2019-12-18 21:31:41,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:42,099 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-18 21:31:42,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803693121] [2019-12-18 21:31:42,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:42,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:31:42,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703923909] [2019-12-18 21:31:42,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:31:42,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:42,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:31:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:31:42,102 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 5 states. [2019-12-18 21:31:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:42,130 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-18 21:31:42,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:31:42,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:31:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:42,132 INFO L225 Difference]: With dead ends: 653 [2019-12-18 21:31:42,132 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 21:31:42,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:31:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 21:31:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-18 21:31:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-18 21:31:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-18 21:31:42,144 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-18 21:31:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:42,144 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-18 21:31:42,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:31:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-18 21:31:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:31:42,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:42,147 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, 1] [2019-12-18 21:31:42,147 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-18 21:31:42,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:42,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465114453] [2019-12-18 21:31:42,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:42,242 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-18 21:31:42,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465114453] [2019-12-18 21:31:42,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:42,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:31:42,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345810100] [2019-12-18 21:31:42,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:42,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:42,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:42,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:42,246 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-18 21:31:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:42,296 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-18 21:31:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:42,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:31:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:42,299 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:31:42,299 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:31:42,300 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-18 21:31:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:31:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:31:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:31:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-18 21:31:42,309 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-18 21:31:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:42,310 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-18 21:31:42,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-18 21:31:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:31:42,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:42,312 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, 1] [2019-12-18 21:31:42,313 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:42,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-18 21:31:42,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:42,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572768247] [2019-12-18 21:31:42,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:42,412 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-18 21:31:42,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572768247] [2019-12-18 21:31:42,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:42,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:31:42,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025880421] [2019-12-18 21:31:42,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:42,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:42,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:42,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:42,416 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-18 21:31:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:42,470 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-18 21:31:42,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:42,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:31:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:42,476 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:31:42,476 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:31:42,476 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-18 21:31:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:31:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:31:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:31:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-18 21:31:42,487 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-18 21:31:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:42,487 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-18 21:31:42,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-18 21:31:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:31:42,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:42,490 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, 1] [2019-12-18 21:31:42,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:42,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:42,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-18 21:31:42,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:42,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298063030] [2019-12-18 21:31:42,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:42,587 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-18 21:31:42,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298063030] [2019-12-18 21:31:42,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:42,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:31:42,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234889027] [2019-12-18 21:31:42,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:31:42,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:42,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:31:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:31:42,590 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-18 21:31:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:42,792 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-18 21:31:42,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:31:42,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:31:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:42,795 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:31:42,796 INFO L226 Difference]: Without dead ends: 894 [2019-12-18 21:31:42,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:31:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-18 21:31:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-18 21:31:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-18 21:31:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-18 21:31:42,809 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-18 21:31:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:42,810 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-18 21:31:42,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:31:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-18 21:31:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:31:42,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:42,812 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, 1] [2019-12-18 21:31:42,813 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-18 21:31:42,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:42,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500130948] [2019-12-18 21:31:42,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:42,887 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-18 21:31:42,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500130948] [2019-12-18 21:31:42,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:42,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:42,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260185061] [2019-12-18 21:31:42,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:42,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:42,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:42,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:42,889 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 3 states. [2019-12-18 21:31:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:42,946 INFO L93 Difference]: Finished difference Result 719 states and 1687 transitions. [2019-12-18 21:31:42,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:42,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:31:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:42,948 INFO L225 Difference]: With dead ends: 719 [2019-12-18 21:31:42,948 INFO L226 Difference]: Without dead ends: 719 [2019-12-18 21:31:42,949 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-18 21:31:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-12-18 21:31:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 536. [2019-12-18 21:31:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 21:31:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1264 transitions. [2019-12-18 21:31:42,958 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1264 transitions. Word has length 55 [2019-12-18 21:31:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:42,959 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1264 transitions. [2019-12-18 21:31:42,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1264 transitions. [2019-12-18 21:31:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:31:42,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:42,961 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, 1, 1] [2019-12-18 21:31:42,961 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash 966806383, now seen corresponding path program 1 times [2019-12-18 21:31:42,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:42,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058718161] [2019-12-18 21:31:42,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:43,027 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-18 21:31:43,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058718161] [2019-12-18 21:31:43,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:43,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:43,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378960647] [2019-12-18 21:31:43,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:43,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:43,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:43,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:43,029 INFO L87 Difference]: Start difference. First operand 536 states and 1264 transitions. Second operand 3 states. [2019-12-18 21:31:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:43,042 INFO L93 Difference]: Finished difference Result 512 states and 1174 transitions. [2019-12-18 21:31:43,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:43,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:31:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:43,044 INFO L225 Difference]: With dead ends: 512 [2019-12-18 21:31:43,044 INFO L226 Difference]: Without dead ends: 512 [2019-12-18 21:31:43,044 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-18 21:31:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-18 21:31:43,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 476. [2019-12-18 21:31:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-18 21:31:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1088 transitions. [2019-12-18 21:31:43,052 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1088 transitions. Word has length 56 [2019-12-18 21:31:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:43,052 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1088 transitions. [2019-12-18 21:31:43,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1088 transitions. [2019-12-18 21:31:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:31:43,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:43,054 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, 1, 1, 1] [2019-12-18 21:31:43,054 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:43,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash 693794399, now seen corresponding path program 1 times [2019-12-18 21:31:43,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:43,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491719266] [2019-12-18 21:31:43,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:43,171 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-18 21:31:43,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491719266] [2019-12-18 21:31:43,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:43,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:31:43,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992616522] [2019-12-18 21:31:43,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:31:43,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:31:43,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:31:43,175 INFO L87 Difference]: Start difference. First operand 476 states and 1088 transitions. Second operand 5 states. [2019-12-18 21:31:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:43,224 INFO L93 Difference]: Finished difference Result 719 states and 1520 transitions. [2019-12-18 21:31:43,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:31:43,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 21:31:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:43,225 INFO L225 Difference]: With dead ends: 719 [2019-12-18 21:31:43,225 INFO L226 Difference]: Without dead ends: 280 [2019-12-18 21:31:43,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:31:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-18 21:31:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-12-18 21:31:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-18 21:31:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-18 21:31:43,230 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 57 [2019-12-18 21:31:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:43,230 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-18 21:31:43,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:31:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-18 21:31:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:31:43,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:43,232 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, 1, 1, 1] [2019-12-18 21:31:43,232 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 2 times [2019-12-18 21:31:43,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:43,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901430899] [2019-12-18 21:31:43,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:43,964 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-18 21:31:43,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901430899] [2019-12-18 21:31:43,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:43,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 21:31:43,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868403328] [2019-12-18 21:31:43,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 21:31:43,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:43,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 21:31:43,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:31:43,967 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 19 states. [2019-12-18 21:31:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:45,862 INFO L93 Difference]: Finished difference Result 710 states and 1260 transitions. [2019-12-18 21:31:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 21:31:45,863 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-18 21:31:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:45,864 INFO L225 Difference]: With dead ends: 710 [2019-12-18 21:31:45,864 INFO L226 Difference]: Without dead ends: 676 [2019-12-18 21:31:45,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 21:31:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-12-18 21:31:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 386. [2019-12-18 21:31:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-18 21:31:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 682 transitions. [2019-12-18 21:31:45,873 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 682 transitions. Word has length 57 [2019-12-18 21:31:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:45,873 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 682 transitions. [2019-12-18 21:31:45,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 21:31:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 682 transitions. [2019-12-18 21:31:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:31:45,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:45,875 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, 1, 1, 1] [2019-12-18 21:31:45,875 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash 155274265, now seen corresponding path program 3 times [2019-12-18 21:31:45,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:45,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511556546] [2019-12-18 21:31:45,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:46,097 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-18 21:31:46,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511556546] [2019-12-18 21:31:46,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:46,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:31:46,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214681257] [2019-12-18 21:31:46,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:31:46,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:46,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:31:46,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:31:46,099 INFO L87 Difference]: Start difference. First operand 386 states and 682 transitions. Second operand 12 states. [2019-12-18 21:31:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:46,633 INFO L93 Difference]: Finished difference Result 658 states and 1131 transitions. [2019-12-18 21:31:46,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:31:46,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 21:31:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:46,635 INFO L225 Difference]: With dead ends: 658 [2019-12-18 21:31:46,635 INFO L226 Difference]: Without dead ends: 624 [2019-12-18 21:31:46,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:31:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-12-18 21:31:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 414. [2019-12-18 21:31:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-18 21:31:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 736 transitions. [2019-12-18 21:31:46,647 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 736 transitions. Word has length 57 [2019-12-18 21:31:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:46,647 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 736 transitions. [2019-12-18 21:31:46,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:31:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 736 transitions. [2019-12-18 21:31:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:31:46,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:46,650 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, 1, 1, 1] [2019-12-18 21:31:46,650 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 4 times [2019-12-18 21:31:46,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:46,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747749735] [2019-12-18 21:31:46,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:31:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:31:46,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:31:46,821 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:31:46,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25|) |v_ULTIMATE.start_main_~#t1214~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$w_buff1~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~y$r_buff0_thd2~0_20 0) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1214~0.base_25| 4)) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff0_used~0_108 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$flush_delayed~0_14) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y$r_buff0_thd0~0_80 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1214~0.base_25|) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~y~0_26 0) (= v_~y$r_buff0_thd1~0_6 0) (= 0 |v_ULTIMATE.start_main_~#t1214~0.offset_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_19|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_~#t1214~0.offset=|v_ULTIMATE.start_main_~#t1214~0.offset_19|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~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_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_~#t1214~0.base=|v_ULTIMATE.start_main_~#t1214~0.base_25|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, ULTIMATE.start_main_#t~ite28, #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, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, 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, ~y$w_buff1~0, ULTIMATE.start_main_~#t1215~0.offset, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1214~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1215~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1214~0.base, 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-18 21:31:46,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1215~0.base_13| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1215~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1215~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t1215~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13|) |v_ULTIMATE.start_main_~#t1215~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1215~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1215~0.base] because there is no mapped edge [2019-12-18 21:31:46,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1216~0.base_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13|) |v_ULTIMATE.start_main_~#t1216~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1216~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1216~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:31:46,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6) (= 1 v_~y$w_buff0_used~0_77) (= 2 v_~y$w_buff0~0_14) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_78) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:31:46,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:31:46,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In472045153 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In472045153 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out472045153| ~y$w_buff0_used~0_In472045153) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out472045153| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In472045153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In472045153} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In472045153, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out472045153|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In472045153} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 21:31:46,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1049801318 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1049801318 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1049801318 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1049801318 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1049801318|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1049801318 |P2Thread1of1ForFork0_#t~ite12_Out1049801318|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1049801318, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1049801318, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1049801318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1049801318} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1049801318, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1049801318, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1049801318|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1049801318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1049801318} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:31:46,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In670993497 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In670993497 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In670993497 ~y$r_buff0_thd3~0_Out670993497)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out670993497 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In670993497, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In670993497} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In670993497, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out670993497, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out670993497|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 21:31:46,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1478266112 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1478266112 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1478266112 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1478266112 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1478266112|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite14_Out1478266112| ~y$r_buff1_thd3~0_In1478266112) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1478266112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1478266112, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1478266112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478266112} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1478266112|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1478266112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1478266112, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1478266112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478266112} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:31:46,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:31:46,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In856013768 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In856013768 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out856013768| ~y~0_In856013768)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out856013768| ~y$w_buff1~0_In856013768)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In856013768, ~y$w_buff1~0=~y$w_buff1~0_In856013768, ~y~0=~y~0_In856013768, ~y$w_buff1_used~0=~y$w_buff1_used~0_In856013768} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In856013768, ~y$w_buff1~0=~y$w_buff1~0_In856013768, ~y~0=~y~0_In856013768, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out856013768|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In856013768} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:31:46,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:31:46,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2063315328 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2063315328 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out-2063315328| ~y$w_buff0_used~0_In-2063315328)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out-2063315328| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2063315328, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2063315328} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2063315328, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2063315328, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-2063315328|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:31:46,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-908365916 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-908365916 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-908365916 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-908365916 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite6_Out-908365916| ~y$w_buff1_used~0_In-908365916) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out-908365916| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-908365916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908365916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-908365916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908365916} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-908365916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-908365916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-908365916, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-908365916|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908365916} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:31:46,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1438155138 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1438155138 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out-1438155138| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-1438155138 |P1Thread1of1ForFork2_#t~ite7_Out-1438155138|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1438155138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1438155138} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1438155138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1438155138, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1438155138|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:31:46,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-379319578 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-379319578 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-379319578 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-379319578 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-379319578| ~y$r_buff1_thd2~0_In-379319578) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite8_Out-379319578| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-379319578, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-379319578, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-379319578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-379319578} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-379319578, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-379319578, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-379319578|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-379319578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-379319578} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:31:46,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:31:46,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:31:46,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1273163370 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1273163370 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out1273163370| |ULTIMATE.start_main_#t~ite18_Out1273163370|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out1273163370| ~y~0_In1273163370) .cse2) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1273163370 |ULTIMATE.start_main_#t~ite18_Out1273163370|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1273163370, ~y~0=~y~0_In1273163370, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1273163370, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1273163370} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1273163370, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1273163370|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1273163370|, ~y~0=~y~0_In1273163370, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1273163370, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1273163370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:31:46,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1873165839 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1873165839 256)))) (or (and (= ~y$w_buff0_used~0_In-1873165839 |ULTIMATE.start_main_#t~ite20_Out-1873165839|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1873165839|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1873165839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1873165839} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1873165839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1873165839, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1873165839|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:31:46,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In719200686 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In719200686 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In719200686 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In719200686 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out719200686| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite21_Out719200686| ~y$w_buff1_used~0_In719200686) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In719200686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719200686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In719200686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In719200686} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In719200686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719200686, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out719200686|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In719200686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In719200686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:31:46,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1401527786 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1401527786 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out1401527786|)) (and (= |ULTIMATE.start_main_#t~ite22_Out1401527786| ~y$r_buff0_thd0~0_In1401527786) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1401527786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401527786} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1401527786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401527786, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1401527786|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:31:46,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-185447783 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-185447783 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-185447783 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-185447783 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-185447783 |ULTIMATE.start_main_#t~ite23_Out-185447783|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite23_Out-185447783| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-185447783, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-185447783, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-185447783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185447783} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-185447783, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-185447783, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-185447783, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-185447783|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185447783} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:31:46,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1321169835 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite33_Out-1321169835| |ULTIMATE.start_main_#t~ite32_Out-1321169835|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1321169835 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1321169835 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1321169835 256))) (= (mod ~y$w_buff0_used~0_In-1321169835 256) 0))) (= ~y$w_buff1~0_In-1321169835 |ULTIMATE.start_main_#t~ite32_Out-1321169835|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In-1321169835| |ULTIMATE.start_main_#t~ite32_Out-1321169835|) (= ~y$w_buff1~0_In-1321169835 |ULTIMATE.start_main_#t~ite33_Out-1321169835|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1321169835, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1321169835, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1321169835, ~weak$$choice2~0=~weak$$choice2~0_In-1321169835, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1321169835, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-1321169835|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1321169835} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1321169835, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1321169835, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1321169835, ~weak$$choice2~0=~weak$$choice2~0_In-1321169835, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1321169835|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1321169835, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1321169835|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1321169835} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 21:31:46,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1382499478 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1382499478 |ULTIMATE.start_main_#t~ite36_Out-1382499478|) (= |ULTIMATE.start_main_#t~ite35_In-1382499478| |ULTIMATE.start_main_#t~ite35_Out-1382499478|) (not .cse0)) (and (= ~y$w_buff0_used~0_In-1382499478 |ULTIMATE.start_main_#t~ite35_Out-1382499478|) .cse0 (= |ULTIMATE.start_main_#t~ite36_Out-1382499478| |ULTIMATE.start_main_#t~ite35_Out-1382499478|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1382499478 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1382499478 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1382499478 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1382499478 256) 0))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1382499478, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1382499478, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1382499478|, ~weak$$choice2~0=~weak$$choice2~0_In-1382499478, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1382499478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1382499478} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1382499478, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1382499478, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1382499478|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1382499478|, ~weak$$choice2~0=~weak$$choice2~0_In-1382499478, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1382499478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1382499478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:31:46,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-754307120 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In-754307120| |ULTIMATE.start_main_#t~ite38_Out-754307120|) (= |ULTIMATE.start_main_#t~ite39_Out-754307120| ~y$w_buff1_used~0_In-754307120)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-754307120 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-754307120 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-754307120 256))) (and (= (mod ~y$w_buff1_used~0_In-754307120 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out-754307120| |ULTIMATE.start_main_#t~ite39_Out-754307120|) (= |ULTIMATE.start_main_#t~ite38_Out-754307120| ~y$w_buff1_used~0_In-754307120) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-754307120, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-754307120, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-754307120|, ~weak$$choice2~0=~weak$$choice2~0_In-754307120, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-754307120, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-754307120} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-754307120, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-754307120|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-754307120, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-754307120|, ~weak$$choice2~0=~weak$$choice2~0_In-754307120, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-754307120, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-754307120} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:31:46,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_64 v_~y$r_buff0_thd0~0_63)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:31:46,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L839-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_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_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:31:46,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:31:46,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:31:46 BasicIcfg [2019-12-18 21:31:46,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:31:46,969 INFO L168 Benchmark]: Toolchain (without parser) took 17744.74 ms. Allocated memory was 136.8 MB in the beginning and 902.3 MB in the end (delta: 765.5 MB). Free memory was 100.1 MB in the beginning and 590.6 MB in the end (delta: -490.5 MB). Peak memory consumption was 274.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:46,970 INFO L168 Benchmark]: CDTParser took 1.11 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:31:46,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.26 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 154.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:46,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.27 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:46,978 INFO L168 Benchmark]: Boogie Preprocessor took 38.56 ms. Allocated memory is still 200.8 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:46,979 INFO L168 Benchmark]: RCFGBuilder took 796.13 ms. Allocated memory is still 200.8 MB. Free memory was 148.7 MB in the beginning and 101.9 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:46,980 INFO L168 Benchmark]: TraceAbstraction took 15960.41 ms. Allocated memory was 200.8 MB in the beginning and 902.3 MB in the end (delta: 701.5 MB). Free memory was 101.2 MB in the beginning and 590.6 MB in the end (delta: -489.4 MB). Peak memory consumption was 212.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:46,987 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.26 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 154.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.27 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.56 ms. Allocated memory is still 200.8 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.13 ms. Allocated memory is still 200.8 MB. Free memory was 148.7 MB in the beginning and 101.9 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15960.41 ms. Allocated memory was 200.8 MB in the beginning and 902.3 MB in the end (delta: 701.5 MB). Free memory was 101.2 MB in the beginning and 590.6 MB in the end (delta: -489.4 MB). Peak memory consumption was 212.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 164 ProgramPointsBefore, 84 ProgramPointsAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4106 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48939 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L812] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 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 [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 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 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L831] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L831] 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) [L832] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L837] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1270 SDtfs, 1189 SDslu, 2900 SDs, 0 SdLazy, 2086 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24300occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 3214 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 93145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...