/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_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:30:19,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:30:19,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:30:19,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:30:19,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:30:19,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:30:19,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:30:19,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:30:19,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:30:19,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:30:19,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:30:19,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:30:19,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:30:19,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:30:20,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:30:20,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:30:20,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:30:20,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:30:20,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:30:20,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:30:20,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:30:20,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:30:20,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:30:20,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:30:20,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:30:20,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:30:20,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:30:20,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:30:20,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:30:20,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:30:20,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:30:20,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:30:20,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:30:20,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:30:20,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:30:20,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:30:20,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:30:20,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:30:20,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:30:20,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:30:20,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:30:20,034 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:30:20,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:30:20,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:30:20,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:30:20,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:30:20,050 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:30:20,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:30:20,051 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:30:20,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:30:20,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:30:20,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:30:20,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:30:20,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:30:20,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:30:20,052 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:30:20,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:30:20,052 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:30:20,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:30:20,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:30:20,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:30:20,053 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:30:20,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:30:20,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:30:20,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:30:20,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:30:20,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:30:20,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:30:20,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:30:20,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:30:20,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:30:20,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:30:20,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:30:20,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:30:20,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:30:20,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:30:20,364 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:30:20,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2019-12-18 21:30:20,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d72163ba/3fbe2e18e4784eea8629975c98fc6540/FLAGb05e27530 [2019-12-18 21:30:21,012 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:30:21,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2019-12-18 21:30:21,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d72163ba/3fbe2e18e4784eea8629975c98fc6540/FLAGb05e27530 [2019-12-18 21:30:21,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d72163ba/3fbe2e18e4784eea8629975c98fc6540 [2019-12-18 21:30:21,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:30:21,370 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:30:21,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:30:21,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:30:21,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:30:21,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:30:21" (1/1) ... [2019-12-18 21:30:21,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a376ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:21, skipping insertion in model container [2019-12-18 21:30:21,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:30:21" (1/1) ... [2019-12-18 21:30:21,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:30:21,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:30:21,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:30:21,961 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:30:22,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:30:22,158 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:30:22,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22 WrapperNode [2019-12-18 21:30:22,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:30:22,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:30:22,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:30:22,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:30:22,169 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:30:22" (1/1) ... [2019-12-18 21:30:22,190 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:30:22" (1/1) ... [2019-12-18 21:30:22,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:30:22,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:30:22,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:30:22,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:30:22,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (1/1) ... [2019-12-18 21:30:22,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (1/1) ... [2019-12-18 21:30:22,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (1/1) ... [2019-12-18 21:30:22,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (1/1) ... [2019-12-18 21:30:22,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (1/1) ... [2019-12-18 21:30:22,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (1/1) ... [2019-12-18 21:30:22,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (1/1) ... [2019-12-18 21:30:22,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:30:22,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:30:22,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:30:22,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:30:22,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (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:30:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:30:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:30:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:30:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:30:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:30:22,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:30:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:30:22,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:30:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:30:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:30:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:30:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:30:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:30:22,366 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:30:23,048 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:30:23,049 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:30:23,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:30:23 BoogieIcfgContainer [2019-12-18 21:30:23,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:30:23,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:30:23,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:30:23,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:30:23,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:30:21" (1/3) ... [2019-12-18 21:30:23,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8bcc4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:30:23, skipping insertion in model container [2019-12-18 21:30:23,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:22" (2/3) ... [2019-12-18 21:30:23,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8bcc4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:30:23, skipping insertion in model container [2019-12-18 21:30:23,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:30:23" (3/3) ... [2019-12-18 21:30:23,060 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_power.opt.i [2019-12-18 21:30:23,071 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:30:23,072 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:30:23,080 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:30:23,081 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:30:23,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,142 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,143 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,143 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,166 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,167 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,170 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:23,221 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:30:23,245 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:30:23,245 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:30:23,245 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:30:23,245 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:30:23,246 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:30:23,249 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:30:23,250 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:30:23,250 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:30:23,274 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 21:30:23,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 21:30:23,364 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 21:30:23,365 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:30:23,380 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:30:23,400 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 21:30:23,490 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 21:30:23,491 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:30:23,499 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:30:23,516 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:30:23,517 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:30:26,979 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:30:27,094 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:30:27,117 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-18 21:30:27,117 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 21:30:27,121 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-18 21:30:28,303 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-18 21:30:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-18 21:30:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:30:28,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:28,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:28,312 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:30:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:28,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-18 21:30:28,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:28,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100667816] [2019-12-18 21:30:28,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:30:28,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100667816] [2019-12-18 21:30:28,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:28,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:30:28,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856557779] [2019-12-18 21:30:28,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:28,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:28,590 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-18 21:30:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:28,992 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-18 21:30:28,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:28,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:30:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:29,271 INFO L225 Difference]: With dead ends: 17518 [2019-12-18 21:30:29,271 INFO L226 Difference]: Without dead ends: 17154 [2019-12-18 21:30:29,276 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:30:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-18 21:30:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-18 21:30:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-18 21:30:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-18 21:30:30,738 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-18 21:30:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:30,739 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-18 21:30:30,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-18 21:30:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:30:30,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:30,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:30,870 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:30:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:30,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-18 21:30:30,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:30,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989061409] [2019-12-18 21:30:30,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:30,999 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:30:31,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989061409] [2019-12-18 21:30:31,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:31,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:30:31,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039963350] [2019-12-18 21:30:31,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:30:31,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:31,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:30:31,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:30:31,004 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 4 states. [2019-12-18 21:30:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:31,744 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-18 21:30:31,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:30:31,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:30:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:31,862 INFO L225 Difference]: With dead ends: 26570 [2019-12-18 21:30:31,862 INFO L226 Difference]: Without dead ends: 26556 [2019-12-18 21:30:31,863 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:30:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-18 21:30:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-18 21:30:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-18 21:30:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-18 21:30:32,854 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-18 21:30:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:33,888 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-18 21:30:33,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:30:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-18 21:30:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:30:33,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:33,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:33,892 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:30:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-18 21:30:33,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:33,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21651328] [2019-12-18 21:30:33,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:33,965 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:30:33,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21651328] [2019-12-18 21:30:33,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:33,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:30:33,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199552323] [2019-12-18 21:30:33,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:33,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:33,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:33,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:33,967 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-18 21:30:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:34,044 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-18 21:30:34,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:34,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:30:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:34,094 INFO L225 Difference]: With dead ends: 13809 [2019-12-18 21:30:34,094 INFO L226 Difference]: Without dead ends: 13809 [2019-12-18 21:30:34,094 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:30:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-18 21:30:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-18 21:30:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-18 21:30:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-18 21:30:34,497 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-18 21:30:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:34,498 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-18 21:30:34,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-18 21:30:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:30:34,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:34,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:34,500 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:30:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-18 21:30:34,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:34,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45213623] [2019-12-18 21:30:34,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:34,589 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:30:34,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45213623] [2019-12-18 21:30:34,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:34,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:30:34,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386925329] [2019-12-18 21:30:34,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:30:34,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:30:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:30:34,591 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 4 states. [2019-12-18 21:30:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:34,615 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-18 21:30:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:30:34,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:30:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:34,620 INFO L225 Difference]: With dead ends: 2006 [2019-12-18 21:30:34,621 INFO L226 Difference]: Without dead ends: 2006 [2019-12-18 21:30:34,621 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:30:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-18 21:30:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-18 21:30:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-18 21:30:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-18 21:30:34,655 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-18 21:30:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:34,656 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-18 21:30:34,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:30:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-18 21:30:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:30:34,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:34,658 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:30:34,659 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:30:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:34,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-18 21:30:34,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:34,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101826338] [2019-12-18 21:30:34,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:34,723 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:30:34,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101826338] [2019-12-18 21:30:34,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:34,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:30:34,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835030289] [2019-12-18 21:30:34,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:30:34,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:34,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:30:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:30:34,725 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 5 states. [2019-12-18 21:30:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:34,758 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-18 21:30:34,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:30:34,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:30:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:34,760 INFO L225 Difference]: With dead ends: 653 [2019-12-18 21:30:34,760 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 21:30:34,761 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:30:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 21:30:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-18 21:30:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-18 21:30:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-18 21:30:34,772 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-18 21:30:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:34,772 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-18 21:30:34,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:30:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-18 21:30:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:34,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:34,775 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:30:34,775 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:30:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-18 21:30:34,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:34,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600948036] [2019-12-18 21:30:34,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:34,871 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:30:34,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600948036] [2019-12-18 21:30:34,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:34,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:30:34,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975593402] [2019-12-18 21:30:34,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:34,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:34,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:34,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:34,873 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-18 21:30:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:34,929 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-18 21:30:34,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:34,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:30:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:34,932 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:30:34,932 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:30:34,933 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:30:34,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:30:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:30:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:30:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-18 21:30:34,944 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-18 21:30:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:34,944 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-18 21:30:34,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-18 21:30:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:34,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:34,946 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:30:34,947 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:30:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-18 21:30:34,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:34,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790076260] [2019-12-18 21:30:34,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:35,033 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:30:35,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790076260] [2019-12-18 21:30:35,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:35,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:30:35,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99898540] [2019-12-18 21:30:35,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:35,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:35,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:35,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:35,037 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-18 21:30:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:35,090 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-18 21:30:35,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:35,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:30:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:35,092 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:30:35,095 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:30:35,096 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:30:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:30:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:30:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:30:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-18 21:30:35,107 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-18 21:30:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:35,107 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-18 21:30:35,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-18 21:30:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:35,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:35,109 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:30:35,109 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:30:35,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:35,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-18 21:30:35,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:35,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280035194] [2019-12-18 21:30:35,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:35,217 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:30:35,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280035194] [2019-12-18 21:30:35,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:35,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:30:35,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594210216] [2019-12-18 21:30:35,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:30:35,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:35,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:30:35,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:30:35,220 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-18 21:30:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:35,432 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-18 21:30:35,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:30:35,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:30:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:35,435 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:30:35,435 INFO L226 Difference]: Without dead ends: 894 [2019-12-18 21:30:35,436 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:30:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-18 21:30:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-18 21:30:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-18 21:30:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-18 21:30:35,450 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-18 21:30:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:35,450 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-18 21:30:35,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:30:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-18 21:30:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:35,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:35,453 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:30:35,453 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:30:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:35,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-18 21:30:35,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:35,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546160927] [2019-12-18 21:30:35,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:35,572 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:30:35,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546160927] [2019-12-18 21:30:35,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:35,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:30:35,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511952095] [2019-12-18 21:30:35,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:30:35,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:30:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:30:35,575 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 5 states. [2019-12-18 21:30:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:35,622 INFO L93 Difference]: Finished difference Result 1075 states and 2344 transitions. [2019-12-18 21:30:35,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:30:35,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:30:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:35,623 INFO L225 Difference]: With dead ends: 1075 [2019-12-18 21:30:35,623 INFO L226 Difference]: Without dead ends: 411 [2019-12-18 21:30:35,623 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:30:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-12-18 21:30:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-12-18 21:30:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-18 21:30:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 759 transitions. [2019-12-18 21:30:35,630 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 759 transitions. Word has length 55 [2019-12-18 21:30:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:35,631 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 759 transitions. [2019-12-18 21:30:35,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:30:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 759 transitions. [2019-12-18 21:30:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:35,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:35,632 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:30:35,632 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:30:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1996947010, now seen corresponding path program 3 times [2019-12-18 21:30:35,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:35,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494036784] [2019-12-18 21:30:35,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:35,748 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:30:35,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494036784] [2019-12-18 21:30:35,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:35,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:30:35,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768443764] [2019-12-18 21:30:35,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:30:35,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:35,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:30:35,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:30:35,750 INFO L87 Difference]: Start difference. First operand 411 states and 759 transitions. Second operand 6 states. [2019-12-18 21:30:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:36,087 INFO L93 Difference]: Finished difference Result 549 states and 1004 transitions. [2019-12-18 21:30:36,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:30:36,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 21:30:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:36,090 INFO L225 Difference]: With dead ends: 549 [2019-12-18 21:30:36,090 INFO L226 Difference]: Without dead ends: 549 [2019-12-18 21:30:36,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:30:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-12-18 21:30:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 442. [2019-12-18 21:30:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-12-18 21:30:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 816 transitions. [2019-12-18 21:30:36,102 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 816 transitions. Word has length 55 [2019-12-18 21:30:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:36,103 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 816 transitions. [2019-12-18 21:30:36,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:30:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 816 transitions. [2019-12-18 21:30:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:36,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:36,104 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:30:36,105 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:30:36,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:36,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1263831852, now seen corresponding path program 4 times [2019-12-18 21:30:36,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:36,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752649651] [2019-12-18 21:30:36,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:36,282 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:30:36,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752649651] [2019-12-18 21:30:36,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:36,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:30:36,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338992267] [2019-12-18 21:30:36,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:30:36,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:36,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:30:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:30:36,287 INFO L87 Difference]: Start difference. First operand 442 states and 816 transitions. Second operand 6 states. [2019-12-18 21:30:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:36,681 INFO L93 Difference]: Finished difference Result 715 states and 1303 transitions. [2019-12-18 21:30:36,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:30:36,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 21:30:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:36,683 INFO L225 Difference]: With dead ends: 715 [2019-12-18 21:30:36,683 INFO L226 Difference]: Without dead ends: 715 [2019-12-18 21:30:36,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:30:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-12-18 21:30:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 472. [2019-12-18 21:30:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-18 21:30:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 876 transitions. [2019-12-18 21:30:36,693 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 876 transitions. Word has length 55 [2019-12-18 21:30:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:36,694 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 876 transitions. [2019-12-18 21:30:36,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:30:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 876 transitions. [2019-12-18 21:30:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:36,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:36,695 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:30:36,696 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:30:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash -246727204, now seen corresponding path program 5 times [2019-12-18 21:30:36,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:36,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795456953] [2019-12-18 21:30:36,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:36,760 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:30:36,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795456953] [2019-12-18 21:30:36,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:36,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:30:36,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998490929] [2019-12-18 21:30:36,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:36,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:36,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:36,763 INFO L87 Difference]: Start difference. First operand 472 states and 876 transitions. Second operand 3 states. [2019-12-18 21:30:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:36,785 INFO L93 Difference]: Finished difference Result 421 states and 760 transitions. [2019-12-18 21:30:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:36,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:30:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:36,787 INFO L225 Difference]: With dead ends: 421 [2019-12-18 21:30:36,787 INFO L226 Difference]: Without dead ends: 421 [2019-12-18 21:30:36,788 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:30:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-18 21:30:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-12-18 21:30:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-18 21:30:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 760 transitions. [2019-12-18 21:30:36,795 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 760 transitions. Word has length 55 [2019-12-18 21:30:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:36,795 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 760 transitions. [2019-12-18 21:30:36,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 760 transitions. [2019-12-18 21:30:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:30:36,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:36,797 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:30:36,798 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:30:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1676967486, now seen corresponding path program 1 times [2019-12-18 21:30:36,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:36,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211314092] [2019-12-18 21:30:36,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:36,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:30:36,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211314092] [2019-12-18 21:30:36,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:36,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:30:36,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035625553] [2019-12-18 21:30:36,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:36,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:36,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:36,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:36,924 INFO L87 Difference]: Start difference. First operand 421 states and 760 transitions. Second operand 3 states. [2019-12-18 21:30:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:36,989 INFO L93 Difference]: Finished difference Result 421 states and 759 transitions. [2019-12-18 21:30:36,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:36,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:30:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:36,991 INFO L225 Difference]: With dead ends: 421 [2019-12-18 21:30:36,991 INFO L226 Difference]: Without dead ends: 421 [2019-12-18 21:30:36,991 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:30:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-18 21:30:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 280. [2019-12-18 21:30:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-18 21:30:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-18 21:30:36,998 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 56 [2019-12-18 21:30:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:36,999 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-18 21:30:36,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-18 21:30:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:30:37,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:37,001 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:30:37,001 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:30:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:37,002 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 1 times [2019-12-18 21:30:37,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:37,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121908659] [2019-12-18 21:30:37,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:37,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:30:37,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121908659] [2019-12-18 21:30:37,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:37,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:30:37,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853625020] [2019-12-18 21:30:37,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:30:37,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:37,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:30:37,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:30:37,590 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 18 states. [2019-12-18 21:30:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:39,261 INFO L93 Difference]: Finished difference Result 690 states and 1221 transitions. [2019-12-18 21:30:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:30:39,262 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-18 21:30:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:39,264 INFO L225 Difference]: With dead ends: 690 [2019-12-18 21:30:39,264 INFO L226 Difference]: Without dead ends: 656 [2019-12-18 21:30:39,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:30:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-12-18 21:30:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 386. [2019-12-18 21:30:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-18 21:30:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 682 transitions. [2019-12-18 21:30:39,272 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 682 transitions. Word has length 57 [2019-12-18 21:30:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:39,273 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 682 transitions. [2019-12-18 21:30:39,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:30:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 682 transitions. [2019-12-18 21:30:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:30:39,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:39,274 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:30:39,275 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash 155274265, now seen corresponding path program 2 times [2019-12-18 21:30:39,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:39,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406648548] [2019-12-18 21:30:39,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:39,890 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:30:39,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406648548] [2019-12-18 21:30:39,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:39,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 21:30:39,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106534728] [2019-12-18 21:30:39,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 21:30:39,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:39,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 21:30:39,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-12-18 21:30:39,892 INFO L87 Difference]: Start difference. First operand 386 states and 682 transitions. Second operand 21 states. [2019-12-18 21:30:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:41,944 INFO L93 Difference]: Finished difference Result 783 states and 1359 transitions. [2019-12-18 21:30:41,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 21:30:41,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-12-18 21:30:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:41,946 INFO L225 Difference]: With dead ends: 783 [2019-12-18 21:30:41,946 INFO L226 Difference]: Without dead ends: 749 [2019-12-18 21:30:41,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 21:30:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-12-18 21:30:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 393. [2019-12-18 21:30:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-18 21:30:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 696 transitions. [2019-12-18 21:30:41,955 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 696 transitions. Word has length 57 [2019-12-18 21:30:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:41,956 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 696 transitions. [2019-12-18 21:30:41,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 21:30:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 696 transitions. [2019-12-18 21:30:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:30:41,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:41,957 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:30:41,957 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1816019647, now seen corresponding path program 3 times [2019-12-18 21:30:41,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:41,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071234463] [2019-12-18 21:30:41,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:42,190 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:30:42,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071234463] [2019-12-18 21:30:42,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:42,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:30:42,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767632933] [2019-12-18 21:30:42,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:30:42,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:30:42,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:30:42,196 INFO L87 Difference]: Start difference. First operand 393 states and 696 transitions. Second operand 13 states. [2019-12-18 21:30:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:42,819 INFO L93 Difference]: Finished difference Result 681 states and 1175 transitions. [2019-12-18 21:30:42,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:30:42,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:30:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:42,820 INFO L225 Difference]: With dead ends: 681 [2019-12-18 21:30:42,820 INFO L226 Difference]: Without dead ends: 647 [2019-12-18 21:30:42,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:30:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-12-18 21:30:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 414. [2019-12-18 21:30:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-18 21:30:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 736 transitions. [2019-12-18 21:30:42,828 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 736 transitions. Word has length 57 [2019-12-18 21:30:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:42,829 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 736 transitions. [2019-12-18 21:30:42,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:30:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 736 transitions. [2019-12-18 21:30:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:30:42,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:42,830 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:30:42,830 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:42,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 4 times [2019-12-18 21:30:42,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:42,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351954282] [2019-12-18 21:30:42,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:30:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:30:42,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:30:42,975 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:30:42,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 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_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1196~0.base_25| 1)) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= 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_~#t1196~0.base_25|) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1196~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1196~0.base_25|) |v_ULTIMATE.start_main_~#t1196~0.offset_19| 0)) |v_#memory_int_21|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1196~0.base_25| 4) |v_#length_23|) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= (select .cse0 |v_ULTIMATE.start_main_~#t1196~0.base_25|) 0) (= 0 |v_ULTIMATE.start_main_~#t1196~0.offset_19|) (= 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))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{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, ULTIMATE.start_main_~#t1197~0.base=|v_ULTIMATE.start_main_~#t1197~0.base_25|, ~__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_~#t1198~0.base=|v_ULTIMATE.start_main_~#t1198~0.base_25|, 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, ~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_#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_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_~#t1196~0.offset=|v_ULTIMATE.start_main_~#t1196~0.offset_19|, 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_~#t1198~0.offset=|v_ULTIMATE.start_main_~#t1198~0.offset_19|, 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|, #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_~#t1197~0.offset=|v_ULTIMATE.start_main_~#t1197~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, ULTIMATE.start_main_~#t1196~0.base=|v_ULTIMATE.start_main_~#t1196~0.base_25|, #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_#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, ULTIMATE.start_main_~#t1197~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_~#t1198~0.base, 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, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, 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_#t~ite29, ULTIMATE.start_main_~#t1196~0.offset, 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_~#t1198~0.offset, 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, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1197~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t1196~0.base, #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:30:42,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1197~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1197~0.offset_11| 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1197~0.base_13| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1197~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1197~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1197~0.base_13|) |v_ULTIMATE.start_main_~#t1197~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1197~0.base_13|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1197~0.base_13|) 0)) 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_~#t1197~0.offset=|v_ULTIMATE.start_main_~#t1197~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_~#t1197~0.base=|v_ULTIMATE.start_main_~#t1197~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1197~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1197~0.base] because there is no mapped edge [2019-12-18 21:30:42,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1198~0.base_13| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1198~0.base_13|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1198~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1198~0.base_13| 0)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1198~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1198~0.base_13|) |v_ULTIMATE.start_main_~#t1198~0.offset_11| 2))) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1198~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1198~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1198~0.offset=|v_ULTIMATE.start_main_~#t1198~0.offset_11|, ULTIMATE.start_main_~#t1198~0.base=|v_ULTIMATE.start_main_~#t1198~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1198~0.offset, ULTIMATE.start_main_~#t1198~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:30:42,983 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:30:42,986 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:30:42,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In95874332 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In95874332 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out95874332|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out95874332| ~y$w_buff0_used~0_In95874332)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In95874332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In95874332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In95874332, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out95874332|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In95874332} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 21:30:42,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In488026507 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In488026507 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In488026507 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In488026507 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In488026507 |P2Thread1of1ForFork0_#t~ite12_Out488026507|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out488026507|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In488026507, ~y$w_buff0_used~0=~y$w_buff0_used~0_In488026507, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In488026507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In488026507} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In488026507, ~y$w_buff0_used~0=~y$w_buff0_used~0_In488026507, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out488026507|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In488026507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In488026507} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:30:42,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-802181525 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-802181525 256) 0))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-802181525) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out-802181525 ~y$r_buff0_thd3~0_In-802181525) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-802181525, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-802181525} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-802181525, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-802181525, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-802181525|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 21:30:42,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In591131322 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In591131322 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In591131322 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In591131322 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out591131322| ~y$r_buff1_thd3~0_In591131322)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out591131322| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In591131322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In591131322, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In591131322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591131322} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out591131322|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In591131322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In591131322, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In591131322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591131322} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:30:42,989 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:30:42,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1747228822 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1747228822 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-1747228822| ~y$w_buff1~0_In-1747228822) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1747228822| ~y~0_In-1747228822)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1747228822, ~y$w_buff1~0=~y$w_buff1~0_In-1747228822, ~y~0=~y~0_In-1747228822, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1747228822} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1747228822, ~y$w_buff1~0=~y$w_buff1~0_In-1747228822, ~y~0=~y~0_In-1747228822, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1747228822|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1747228822} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:30:42,990 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:30:42,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-607092787 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-607092787 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-607092787|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-607092787 |P1Thread1of1ForFork2_#t~ite5_Out-607092787|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-607092787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-607092787} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-607092787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-607092787, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-607092787|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:30:42,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-33911121 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-33911121 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-33911121 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-33911121 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out-33911121| ~y$w_buff1_used~0_In-33911121) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out-33911121| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-33911121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-33911121, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-33911121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-33911121} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-33911121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-33911121, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-33911121, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-33911121|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-33911121} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:30:42,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1990072432 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1990072432 256)))) (or (and (= ~y$r_buff0_thd2~0_In-1990072432 |P1Thread1of1ForFork2_#t~ite7_Out-1990072432|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-1990072432|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1990072432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1990072432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1990072432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1990072432, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1990072432|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:30:42,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-2143091536 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2143091536 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2143091536 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-2143091536 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-2143091536|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-2143091536 |P1Thread1of1ForFork2_#t~ite8_Out-2143091536|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2143091536, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143091536, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2143091536, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143091536} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2143091536, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143091536, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-2143091536|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2143091536, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143091536} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:30:42,993 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:30:42,993 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:30:42,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2101315543 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2101315543 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-2101315543| |ULTIMATE.start_main_#t~ite18_Out-2101315543|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out-2101315543| ~y$w_buff1~0_In-2101315543) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite18_Out-2101315543| ~y~0_In-2101315543)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2101315543, ~y~0=~y~0_In-2101315543, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2101315543, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2101315543} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2101315543, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-2101315543|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2101315543|, ~y~0=~y~0_In-2101315543, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2101315543, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2101315543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:30:42,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1076996515 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1076996515 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1076996515| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out1076996515| ~y$w_buff0_used~0_In1076996515)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1076996515, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1076996515} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1076996515, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1076996515, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1076996515|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:30:42,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In585427421 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In585427421 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In585427421 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In585427421 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In585427421 |ULTIMATE.start_main_#t~ite21_Out585427421|)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out585427421|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In585427421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In585427421, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In585427421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In585427421} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In585427421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In585427421, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out585427421|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In585427421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In585427421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:30:42,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1243521087 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1243521087 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1243521087|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1243521087 |ULTIMATE.start_main_#t~ite22_Out-1243521087|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1243521087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1243521087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1243521087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1243521087, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1243521087|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:30:42,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-778714776 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-778714776 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-778714776 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-778714776 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-778714776| ~y$r_buff1_thd0~0_In-778714776) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite23_Out-778714776| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-778714776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-778714776, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-778714776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-778714776} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-778714776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-778714776, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-778714776, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-778714776|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-778714776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:30:43,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-533461780 256) 0))) (or (and (= ~y$w_buff1~0_In-533461780 |ULTIMATE.start_main_#t~ite33_Out-533461780|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In-533461780| |ULTIMATE.start_main_#t~ite32_Out-533461780|)) (and .cse0 (= ~y$w_buff1~0_In-533461780 |ULTIMATE.start_main_#t~ite32_Out-533461780|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-533461780 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-533461780 256)) (and (= (mod ~y$w_buff1_used~0_In-533461780 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-533461780 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite33_Out-533461780| |ULTIMATE.start_main_#t~ite32_Out-533461780|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-533461780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-533461780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-533461780, ~weak$$choice2~0=~weak$$choice2~0_In-533461780, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-533461780, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-533461780|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-533461780} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-533461780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-533461780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-533461780, ~weak$$choice2~0=~weak$$choice2~0_In-533461780, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-533461780|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-533461780, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-533461780|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-533461780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 21:30:43,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In284381753 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite36_Out284381753| |ULTIMATE.start_main_#t~ite35_Out284381753|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In284381753 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In284381753 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In284381753 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In284381753 256)))) (= ~y$w_buff0_used~0_In284381753 |ULTIMATE.start_main_#t~ite35_Out284381753|)) (and (= ~y$w_buff0_used~0_In284381753 |ULTIMATE.start_main_#t~ite36_Out284381753|) (= |ULTIMATE.start_main_#t~ite35_In284381753| |ULTIMATE.start_main_#t~ite35_Out284381753|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In284381753, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In284381753, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In284381753|, ~weak$$choice2~0=~weak$$choice2~0_In284381753, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In284381753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In284381753} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In284381753, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In284381753, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out284381753|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out284381753|, ~weak$$choice2~0=~weak$$choice2~0_In284381753, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In284381753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In284381753} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:30:43,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1755331806 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1755331806| ~y$w_buff1_used~0_In-1755331806) (= |ULTIMATE.start_main_#t~ite38_In-1755331806| |ULTIMATE.start_main_#t~ite38_Out-1755331806|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1755331806 256)))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In-1755331806 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1755331806 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1755331806 256)) .cse1))) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-1755331806| |ULTIMATE.start_main_#t~ite38_Out-1755331806|) (= |ULTIMATE.start_main_#t~ite38_Out-1755331806| ~y$w_buff1_used~0_In-1755331806)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1755331806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1755331806, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1755331806|, ~weak$$choice2~0=~weak$$choice2~0_In-1755331806, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1755331806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755331806} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1755331806, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1755331806|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1755331806, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1755331806|, ~weak$$choice2~0=~weak$$choice2~0_In-1755331806, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1755331806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755331806} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:30:43,002 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:30:43,004 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:30:43,004 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:30:43,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:30:43 BasicIcfg [2019-12-18 21:30:43,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:30:43,098 INFO L168 Benchmark]: Toolchain (without parser) took 21728.23 ms. Allocated memory was 138.4 MB in the beginning and 915.4 MB in the end (delta: 777.0 MB). Free memory was 99.8 MB in the beginning and 656.7 MB in the end (delta: -556.8 MB). Peak memory consumption was 220.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:43,098 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:30:43,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.26 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:43,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.77 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.8 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:30:43,100 INFO L168 Benchmark]: Boogie Preprocessor took 43.54 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.0 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:30:43,101 INFO L168 Benchmark]: RCFGBuilder took 760.92 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 103.1 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:43,102 INFO L168 Benchmark]: TraceAbstraction took 20044.17 ms. Allocated memory was 202.9 MB in the beginning and 915.4 MB in the end (delta: 712.5 MB). Free memory was 103.1 MB in the beginning and 656.7 MB in the end (delta: -553.6 MB). Peak memory consumption was 158.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:43,105 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.26 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.77 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.54 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.92 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 103.1 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20044.17 ms. Allocated memory was 202.9 MB in the beginning and 915.4 MB in the end (delta: 712.5 MB). Free memory was 103.1 MB in the beginning and 656.7 MB in the end (delta: -553.6 MB). Peak memory consumption was 158.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 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(&t1196, ((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(&t1197, ((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(&t1198, ((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: 19.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1629 SDtfs, 1533 SDslu, 4793 SDs, 0 SdLazy, 4193 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.5s 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: 2.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 3845 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 742 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 137871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...