/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:36:04,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:36:04,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:36:04,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:36:04,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:36:04,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:36:04,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:36:04,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:36:04,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:36:04,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:36:04,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:36:04,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:36:04,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:36:04,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:36:04,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:36:04,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:36:04,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:36:04,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:36:04,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:36:04,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:36:04,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:36:04,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:36:04,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:36:04,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:36:04,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:36:04,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:36:04,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:36:04,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:36:04,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:36:04,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:36:04,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:36:04,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:36:04,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:36:04,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:36:04,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:36:04,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:36:04,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:36:04,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:36:04,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:36:04,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:36:04,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:36:04,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:36:04,245 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:36:04,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:36:04,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:36:04,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:36:04,248 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:36:04,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:36:04,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:36:04,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:36:04,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:36:04,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:36:04,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:36:04,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:36:04,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:36:04,250 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:36:04,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:36:04,250 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:36:04,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:36:04,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:36:04,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:36:04,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:36:04,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:36:04,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:36:04,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:36:04,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:36:04,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:36:04,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:36:04,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:36:04,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:36:04,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:36:04,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:36:04,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:36:04,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:36:04,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:36:04,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:36:04,523 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:36:04,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-26 22:36:04,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45f775ba/e50114847f7f456d8943c2cfc83aaa28/FLAG161fbaed7 [2019-12-26 22:36:05,139 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:36:05,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-26 22:36:05,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45f775ba/e50114847f7f456d8943c2cfc83aaa28/FLAG161fbaed7 [2019-12-26 22:36:05,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45f775ba/e50114847f7f456d8943c2cfc83aaa28 [2019-12-26 22:36:05,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:36:05,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:36:05,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:36:05,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:36:05,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:36:05,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:36:05" (1/1) ... [2019-12-26 22:36:05,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2257a400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:05, skipping insertion in model container [2019-12-26 22:36:05,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:36:05" (1/1) ... [2019-12-26 22:36:05,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:36:05,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:36:06,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:36:06,022 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:36:06,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:36:06,159 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:36:06,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06 WrapperNode [2019-12-26 22:36:06,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:36:06,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:36:06,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:36:06,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:36:06,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:36:06,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:36:06,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:36:06,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:36:06,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (1/1) ... [2019-12-26 22:36:06,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:36:06,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:36:06,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:36:06,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:36:06,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (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-26 22:36:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:36:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:36:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:36:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:36:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:36:06,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:36:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:36:06,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:36:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:36:06,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:36:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:36:06,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:36:06,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:36:06,347 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:36:07,133 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:36:07,134 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:36:07,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:36:07 BoogieIcfgContainer [2019-12-26 22:36:07,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:36:07,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:36:07,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:36:07,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:36:07,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:36:05" (1/3) ... [2019-12-26 22:36:07,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1167e8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:36:07, skipping insertion in model container [2019-12-26 22:36:07,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:06" (2/3) ... [2019-12-26 22:36:07,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1167e8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:36:07, skipping insertion in model container [2019-12-26 22:36:07,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:36:07" (3/3) ... [2019-12-26 22:36:07,144 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2019-12-26 22:36:07,155 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:36:07,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:36:07,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:36:07,164 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:36:07,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,223 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,224 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,224 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,224 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,225 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,235 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,236 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,241 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,242 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,265 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,265 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:07,279 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:36:07,295 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:36:07,295 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:36:07,296 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:36:07,296 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:36:07,296 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:36:07,296 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:36:07,296 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:36:07,296 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:36:07,314 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-26 22:36:07,316 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-26 22:36:07,410 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-26 22:36:07,411 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:36:07,424 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:36:07,442 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-26 22:36:07,491 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-26 22:36:07,491 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:36:07,497 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:36:07,512 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-26 22:36:07,513 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:36:12,332 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-26 22:36:12,704 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 22:36:12,859 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 22:36:12,878 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-26 22:36:12,879 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-26 22:36:12,882 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-26 22:36:13,839 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-26 22:36:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-26 22:36:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:36:13,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:13,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:13,847 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-26 22:36:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-26 22:36:13,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:13,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996185180] [2019-12-26 22:36:13,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:14,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-26 22:36:14,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996185180] [2019-12-26 22:36:14,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:14,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:36:14,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840908096] [2019-12-26 22:36:14,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:14,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:14,217 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-26 22:36:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:14,563 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-26 22:36:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:14,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:36:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:14,721 INFO L225 Difference]: With dead ends: 14182 [2019-12-26 22:36:14,721 INFO L226 Difference]: Without dead ends: 13870 [2019-12-26 22:36:14,725 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-26 22:36:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-26 22:36:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-26 22:36:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-26 22:36:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-26 22:36:15,496 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-26 22:36:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:15,497 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-26 22:36:15,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-26 22:36:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:36:15,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:15,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:15,502 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-26 22:36:15,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-26 22:36:15,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:15,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350173261] [2019-12-26 22:36:15,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:15,588 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-26 22:36:15,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350173261] [2019-12-26 22:36:15,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:15,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:15,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261795285] [2019-12-26 22:36:15,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:15,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:15,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:15,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:15,592 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-26 22:36:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:16,111 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-26 22:36:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:16,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:36:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:16,190 INFO L225 Difference]: With dead ends: 19034 [2019-12-26 22:36:16,191 INFO L226 Difference]: Without dead ends: 19034 [2019-12-26 22:36:16,191 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-26 22:36:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-26 22:36:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-26 22:36:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-26 22:36:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-26 22:36:17,905 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-26 22:36:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:17,905 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-26 22:36:17,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-26 22:36:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:36:17,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:17,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:17,908 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-26 22:36:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-26 22:36:17,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:17,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408575816] [2019-12-26 22:36:17,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:17,972 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-26 22:36:17,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408575816] [2019-12-26 22:36:17,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:17,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:17,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150894349] [2019-12-26 22:36:17,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:17,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:17,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:17,975 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-26 22:36:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:18,526 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-26 22:36:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:18,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:36:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:18,655 INFO L225 Difference]: With dead ends: 27022 [2019-12-26 22:36:18,655 INFO L226 Difference]: Without dead ends: 27008 [2019-12-26 22:36:18,656 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-26 22:36:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-26 22:36:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-26 22:36:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-26 22:36:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-26 22:36:19,681 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-26 22:36:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:19,682 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-26 22:36:19,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-26 22:36:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:36:19,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:19,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:19,699 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-26 22:36:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-26 22:36:19,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:19,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622525650] [2019-12-26 22:36:19,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:19,821 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-26 22:36:19,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622525650] [2019-12-26 22:36:19,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:19,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:19,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902415800] [2019-12-26 22:36:19,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:19,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:19,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:19,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:19,824 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-26 22:36:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:20,399 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-26 22:36:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:20,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 22:36:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:20,500 INFO L225 Difference]: With dead ends: 30132 [2019-12-26 22:36:20,500 INFO L226 Difference]: Without dead ends: 30118 [2019-12-26 22:36:20,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-26 22:36:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-26 22:36:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-26 22:36:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-26 22:36:22,389 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-26 22:36:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:22,390 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-26 22:36:22,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:36:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-26 22:36:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:36:22,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:22,418 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] [2019-12-26 22:36:22,418 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-26 22:36:22,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-26 22:36:22,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:22,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010801875] [2019-12-26 22:36:22,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:22,490 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-26 22:36:22,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010801875] [2019-12-26 22:36:22,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:22,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:22,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692905649] [2019-12-26 22:36:22,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:22,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:22,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:22,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:22,493 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 4 states. [2019-12-26 22:36:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:22,571 INFO L93 Difference]: Finished difference Result 13342 states and 41523 transitions. [2019-12-26 22:36:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:36:22,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-26 22:36:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:22,598 INFO L225 Difference]: With dead ends: 13342 [2019-12-26 22:36:22,598 INFO L226 Difference]: Without dead ends: 12812 [2019-12-26 22:36:22,598 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-26 22:36:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-12-26 22:36:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 12812. [2019-12-26 22:36:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-26 22:36:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-26 22:36:23,148 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 27 [2019-12-26 22:36:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:23,148 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-26 22:36:23,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-26 22:36:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:36:23,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:23,161 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] [2019-12-26 22:36:23,161 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-26 22:36:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:23,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-26 22:36:23,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:23,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036186090] [2019-12-26 22:36:23,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:23,311 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-26 22:36:23,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036186090] [2019-12-26 22:36:23,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:23,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:23,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634871460] [2019-12-26 22:36:23,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:23,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:23,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:23,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:23,315 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 5 states. [2019-12-26 22:36:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:23,390 INFO L93 Difference]: Finished difference Result 2336 states and 5507 transitions. [2019-12-26 22:36:23,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:23,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 22:36:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:23,395 INFO L225 Difference]: With dead ends: 2336 [2019-12-26 22:36:23,396 INFO L226 Difference]: Without dead ends: 2027 [2019-12-26 22:36:23,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-26 22:36:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2027. [2019-12-26 22:36:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-12-26 22:36:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4646 transitions. [2019-12-26 22:36:23,450 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4646 transitions. Word has length 28 [2019-12-26 22:36:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:23,451 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 4646 transitions. [2019-12-26 22:36:23,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:36:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4646 transitions. [2019-12-26 22:36:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:36:23,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:23,456 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] [2019-12-26 22:36:23,456 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-26 22:36:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:23,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1654876811, now seen corresponding path program 1 times [2019-12-26 22:36:23,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:23,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513610329] [2019-12-26 22:36:23,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:23,664 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-26 22:36:23,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513610329] [2019-12-26 22:36:23,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:23,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:23,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784962199] [2019-12-26 22:36:23,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:36:23,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:36:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:36:23,673 INFO L87 Difference]: Start difference. First operand 2027 states and 4646 transitions. Second operand 6 states. [2019-12-26 22:36:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:23,742 INFO L93 Difference]: Finished difference Result 690 states and 1578 transitions. [2019-12-26 22:36:23,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:36:23,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 22:36:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:23,744 INFO L225 Difference]: With dead ends: 690 [2019-12-26 22:36:23,744 INFO L226 Difference]: Without dead ends: 644 [2019-12-26 22:36:23,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-26 22:36:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 588. [2019-12-26 22:36:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-26 22:36:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1356 transitions. [2019-12-26 22:36:23,755 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1356 transitions. Word has length 40 [2019-12-26 22:36:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:23,755 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1356 transitions. [2019-12-26 22:36:23,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:36:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1356 transitions. [2019-12-26 22:36:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:36:23,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:23,760 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-26 22:36:23,760 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-26 22:36:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:23,760 INFO L82 PathProgramCache]: Analyzing trace with hash 149828223, now seen corresponding path program 1 times [2019-12-26 22:36:23,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:23,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762587916] [2019-12-26 22:36:23,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:23,840 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-26 22:36:23,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762587916] [2019-12-26 22:36:23,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:23,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:23,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830713496] [2019-12-26 22:36:23,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:23,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:23,843 INFO L87 Difference]: Start difference. First operand 588 states and 1356 transitions. Second operand 3 states. [2019-12-26 22:36:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:23,889 INFO L93 Difference]: Finished difference Result 602 states and 1375 transitions. [2019-12-26 22:36:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:23,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 22:36:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:23,891 INFO L225 Difference]: With dead ends: 602 [2019-12-26 22:36:23,891 INFO L226 Difference]: Without dead ends: 602 [2019-12-26 22:36:23,892 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-26 22:36:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-12-26 22:36:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2019-12-26 22:36:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-26 22:36:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1368 transitions. [2019-12-26 22:36:23,902 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1368 transitions. Word has length 55 [2019-12-26 22:36:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:23,903 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1368 transitions. [2019-12-26 22:36:23,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1368 transitions. [2019-12-26 22:36:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:36:23,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:23,906 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-26 22:36:23,906 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-26 22:36:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1719525699, now seen corresponding path program 1 times [2019-12-26 22:36:23,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:23,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061872960] [2019-12-26 22:36:23,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:24,007 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-26 22:36:24,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061872960] [2019-12-26 22:36:24,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:24,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:24,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366614567] [2019-12-26 22:36:24,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:24,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:24,009 INFO L87 Difference]: Start difference. First operand 596 states and 1368 transitions. Second operand 5 states. [2019-12-26 22:36:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:24,217 INFO L93 Difference]: Finished difference Result 867 states and 1997 transitions. [2019-12-26 22:36:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:36:24,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-26 22:36:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:24,219 INFO L225 Difference]: With dead ends: 867 [2019-12-26 22:36:24,219 INFO L226 Difference]: Without dead ends: 867 [2019-12-26 22:36:24,219 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-26 22:36:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-12-26 22:36:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 789. [2019-12-26 22:36:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-26 22:36:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1820 transitions. [2019-12-26 22:36:24,234 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1820 transitions. Word has length 55 [2019-12-26 22:36:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:24,235 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1820 transitions. [2019-12-26 22:36:24,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:36:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1820 transitions. [2019-12-26 22:36:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:36:24,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:24,237 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-26 22:36:24,238 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-26 22:36:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:24,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1740404695, now seen corresponding path program 2 times [2019-12-26 22:36:24,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:24,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732335487] [2019-12-26 22:36:24,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:24,320 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-26 22:36:24,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732335487] [2019-12-26 22:36:24,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:24,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:24,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905502014] [2019-12-26 22:36:24,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:24,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:24,323 INFO L87 Difference]: Start difference. First operand 789 states and 1820 transitions. Second operand 3 states. [2019-12-26 22:36:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:24,375 INFO L93 Difference]: Finished difference Result 789 states and 1819 transitions. [2019-12-26 22:36:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:24,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 22:36:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:24,378 INFO L225 Difference]: With dead ends: 789 [2019-12-26 22:36:24,378 INFO L226 Difference]: Without dead ends: 789 [2019-12-26 22:36:24,379 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-26 22:36:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-26 22:36:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 632. [2019-12-26 22:36:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-26 22:36:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1459 transitions. [2019-12-26 22:36:24,392 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1459 transitions. Word has length 55 [2019-12-26 22:36:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:24,395 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1459 transitions. [2019-12-26 22:36:24,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1459 transitions. [2019-12-26 22:36:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:36:24,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:24,397 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-26 22:36:24,397 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-26 22:36:24,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:24,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 1 times [2019-12-26 22:36:24,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:24,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863340904] [2019-12-26 22:36:24,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:24,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863340904] [2019-12-26 22:36:24,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:24,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:24,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332929866] [2019-12-26 22:36:24,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:24,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:24,531 INFO L87 Difference]: Start difference. First operand 632 states and 1459 transitions. Second operand 3 states. [2019-12-26 22:36:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:24,546 INFO L93 Difference]: Finished difference Result 632 states and 1429 transitions. [2019-12-26 22:36:24,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:24,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-26 22:36:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:24,547 INFO L225 Difference]: With dead ends: 632 [2019-12-26 22:36:24,547 INFO L226 Difference]: Without dead ends: 632 [2019-12-26 22:36:24,548 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-26 22:36:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-12-26 22:36:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 596. [2019-12-26 22:36:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-26 22:36:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1343 transitions. [2019-12-26 22:36:24,556 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1343 transitions. Word has length 56 [2019-12-26 22:36:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:24,556 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1343 transitions. [2019-12-26 22:36:24,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1343 transitions. [2019-12-26 22:36:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:36:24,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:24,558 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-26 22:36:24,558 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-26 22:36:24,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-26 22:36:24,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:24,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536456578] [2019-12-26 22:36:24,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:24,794 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-26 22:36:24,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536456578] [2019-12-26 22:36:24,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:24,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:36:24,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752476203] [2019-12-26 22:36:24,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:24,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:24,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:24,797 INFO L87 Difference]: Start difference. First operand 596 states and 1343 transitions. Second operand 7 states. [2019-12-26 22:36:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:24,958 INFO L93 Difference]: Finished difference Result 940 states and 1992 transitions. [2019-12-26 22:36:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:36:24,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 22:36:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:24,961 INFO L225 Difference]: With dead ends: 940 [2019-12-26 22:36:24,961 INFO L226 Difference]: Without dead ends: 600 [2019-12-26 22:36:24,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:36:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-26 22:36:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2019-12-26 22:36:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-12-26 22:36:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1164 transitions. [2019-12-26 22:36:24,975 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1164 transitions. Word has length 57 [2019-12-26 22:36:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:24,976 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 1164 transitions. [2019-12-26 22:36:24,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1164 transitions. [2019-12-26 22:36:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:36:24,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:24,978 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-26 22:36:24,979 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-26 22:36:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:24,979 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-26 22:36:24,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:24,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092849775] [2019-12-26 22:36:24,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:25,755 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-26 22:36:25,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092849775] [2019-12-26 22:36:25,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:25,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 22:36:25,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590749506] [2019-12-26 22:36:25,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 22:36:25,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:25,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 22:36:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:36:25,758 INFO L87 Difference]: Start difference. First operand 534 states and 1164 transitions. Second operand 18 states. [2019-12-26 22:36:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:27,094 INFO L93 Difference]: Finished difference Result 1295 states and 2888 transitions. [2019-12-26 22:36:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:36:27,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-26 22:36:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:27,097 INFO L225 Difference]: With dead ends: 1295 [2019-12-26 22:36:27,097 INFO L226 Difference]: Without dead ends: 1265 [2019-12-26 22:36:27,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 22:36:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-26 22:36:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 716. [2019-12-26 22:36:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-12-26 22:36:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1564 transitions. [2019-12-26 22:36:27,108 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1564 transitions. Word has length 57 [2019-12-26 22:36:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:27,108 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1564 transitions. [2019-12-26 22:36:27,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 22:36:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1564 transitions. [2019-12-26 22:36:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:36:27,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:27,110 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-26 22:36:27,110 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-26 22:36:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash -495942269, now seen corresponding path program 3 times [2019-12-26 22:36:27,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:27,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428899883] [2019-12-26 22:36:27,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:27,391 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-26 22:36:27,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428899883] [2019-12-26 22:36:27,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:27,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:36:27,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623018967] [2019-12-26 22:36:27,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:36:27,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:27,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:36:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:36:27,393 INFO L87 Difference]: Start difference. First operand 716 states and 1564 transitions. Second operand 13 states. [2019-12-26 22:36:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:28,073 INFO L93 Difference]: Finished difference Result 1162 states and 2537 transitions. [2019-12-26 22:36:28,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:36:28,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-26 22:36:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:28,076 INFO L225 Difference]: With dead ends: 1162 [2019-12-26 22:36:28,076 INFO L226 Difference]: Without dead ends: 1132 [2019-12-26 22:36:28,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:36:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-12-26 22:36:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 776. [2019-12-26 22:36:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-12-26 22:36:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1710 transitions. [2019-12-26 22:36:28,089 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1710 transitions. Word has length 57 [2019-12-26 22:36:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:28,089 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1710 transitions. [2019-12-26 22:36:28,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:36:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1710 transitions. [2019-12-26 22:36:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:36:28,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:28,091 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-26 22:36:28,091 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-26 22:36:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:28,091 INFO L82 PathProgramCache]: Analyzing trace with hash 60491955, now seen corresponding path program 4 times [2019-12-26 22:36:28,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:28,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562666191] [2019-12-26 22:36:28,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:28,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562666191] [2019-12-26 22:36:28,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:28,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:36:28,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690334481] [2019-12-26 22:36:28,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:36:28,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:28,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:36:28,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:36:28,365 INFO L87 Difference]: Start difference. First operand 776 states and 1710 transitions. Second operand 14 states. [2019-12-26 22:36:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:29,019 INFO L93 Difference]: Finished difference Result 1150 states and 2505 transitions. [2019-12-26 22:36:29,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:36:29,020 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-26 22:36:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:29,022 INFO L225 Difference]: With dead ends: 1150 [2019-12-26 22:36:29,022 INFO L226 Difference]: Without dead ends: 1120 [2019-12-26 22:36:29,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:36:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-26 22:36:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 772. [2019-12-26 22:36:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-12-26 22:36:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1700 transitions. [2019-12-26 22:36:29,034 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1700 transitions. Word has length 57 [2019-12-26 22:36:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:29,034 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1700 transitions. [2019-12-26 22:36:29,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:36:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1700 transitions. [2019-12-26 22:36:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:36:29,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:29,036 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-26 22:36:29,036 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-26 22:36:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:29,037 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 5 times [2019-12-26 22:36:29,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:29,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103144532] [2019-12-26 22:36:29,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:36:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:36:29,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:36:29,142 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:36:29,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27| 1) |v_#valid_54|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1126~0.base_27| 4) |v_#length_19|) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27|) |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0)) |v_#memory_int_15|) (= v_~y$r_buff0_thd1~0_41 0) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= (select .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1126~0.base_27|) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_~#t1126~0.offset=|v_ULTIMATE.start_main_~#t1126~0.offset_21|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1126~0.base=|v_ULTIMATE.start_main_~#t1126~0.base_27|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1127~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1127~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1126~0.offset, 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, ULTIMATE.start_main_~#t1128~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_~#t1126~0.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1128~0.offset, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:36:29,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1127~0.base_9| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1127~0.base_9|) (= |v_ULTIMATE.start_main_~#t1127~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9|) |v_ULTIMATE.start_main_~#t1127~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1127~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1127~0.offset] because there is no mapped edge [2019-12-26 22:36:29,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1128~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1128~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1128~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10|) |v_ULTIMATE.start_main_~#t1128~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1128~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_10|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1128~0.base, ULTIMATE.start_main_~#t1128~0.offset] because there is no mapped edge [2019-12-26 22:36:29,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~z~0_Out101658677 1) (= 1 ~y$r_buff0_thd3~0_Out101658677) (= ~y$r_buff1_thd0~0_Out101658677 ~y$r_buff0_thd0~0_In101658677) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In101658677)) (= ~__unbuffered_p2_EAX~0_Out101658677 ~z~0_Out101658677) (= ~a~0_In101658677 ~__unbuffered_p2_EBX~0_Out101658677) (= ~y$r_buff0_thd1~0_In101658677 ~y$r_buff1_thd1~0_Out101658677) (= ~y$r_buff0_thd2~0_In101658677 ~y$r_buff1_thd2~0_Out101658677) (= ~y$r_buff0_thd3~0_In101658677 ~y$r_buff1_thd3~0_Out101658677)) InVars {~a~0=~a~0_In101658677, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In101658677, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In101658677, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In101658677, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In101658677, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In101658677} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out101658677, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In101658677, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out101658677, ~a~0=~a~0_In101658677, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out101658677, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out101658677, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out101658677, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In101658677, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In101658677, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In101658677, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out101658677, ~z~0=~z~0_Out101658677, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out101658677} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:36:29,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 22:36:29,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1829301021 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1829301021 256))) (.cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out1829301021| |P1Thread1of1ForFork0_#t~ite4_Out1829301021|))) (or (and (= |P1Thread1of1ForFork0_#t~ite3_Out1829301021| ~y~0_In1829301021) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= ~y$w_buff1~0_In1829301021 |P1Thread1of1ForFork0_#t~ite3_Out1829301021|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1829301021, ~y$w_buff1~0=~y$w_buff1~0_In1829301021, ~y~0=~y~0_In1829301021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1829301021} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1829301021, ~y$w_buff1~0=~y$w_buff1~0_In1829301021, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1829301021|, ~y~0=~y~0_In1829301021, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1829301021|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1829301021} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 22:36:29,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1016138166 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1016138166 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_Out1016138166| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1016138166 |P2Thread1of1ForFork1_#t~ite11_Out1016138166|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1016138166, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1016138166} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1016138166, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1016138166|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1016138166} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:36:29,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In835944515 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In835944515 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In835944515 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In835944515 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out835944515|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In835944515 |P2Thread1of1ForFork1_#t~ite12_Out835944515|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In835944515, ~y$w_buff0_used~0=~y$w_buff0_used~0_In835944515, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In835944515, ~y$w_buff1_used~0=~y$w_buff1_used~0_In835944515} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In835944515, ~y$w_buff0_used~0=~y$w_buff0_used~0_In835944515, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In835944515, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out835944515|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In835944515} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:36:29,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-886779472 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-886779472 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-886779472 ~y$r_buff0_thd3~0_Out-886779472)) (and (= 0 ~y$r_buff0_thd3~0_Out-886779472) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-886779472, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-886779472} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-886779472|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-886779472, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-886779472} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:36:29,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In682868186 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In682868186 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In682868186 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In682868186 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_Out682868186| ~y$r_buff1_thd3~0_In682868186) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out682868186|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In682868186, ~y$w_buff0_used~0=~y$w_buff0_used~0_In682868186, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In682868186, ~y$w_buff1_used~0=~y$w_buff1_used~0_In682868186} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out682868186|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In682868186, ~y$w_buff0_used~0=~y$w_buff0_used~0_In682868186, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In682868186, ~y$w_buff1_used~0=~y$w_buff1_used~0_In682868186} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:36:29,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 22:36:29,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1939795727 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1939795727 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite5_Out1939795727| ~y$w_buff0_used~0_In1939795727) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite5_Out1939795727| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1939795727, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1939795727} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1939795727, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1939795727, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1939795727|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:36:29,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In115156500 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In115156500 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In115156500 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In115156500 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out115156500| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite6_Out115156500| ~y$w_buff1_used~0_In115156500) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In115156500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In115156500, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In115156500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In115156500} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In115156500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In115156500, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In115156500, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out115156500|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In115156500} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:36:29,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1126669346 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1126669346 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out-1126669346|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1126669346 |P1Thread1of1ForFork0_#t~ite7_Out-1126669346|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126669346, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1126669346} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126669346, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1126669346, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-1126669346|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 22:36:29,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1128903979 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1128903979 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1128903979 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1128903979 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite8_Out-1128903979| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite8_Out-1128903979| ~y$r_buff1_thd2~0_In-1128903979) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1128903979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1128903979, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1128903979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1128903979} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1128903979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1128903979, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1128903979, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-1128903979|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1128903979} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:36:29,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 22:36:29,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:36:29,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-154880217 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-154880217 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-154880217| |ULTIMATE.start_main_#t~ite18_Out-154880217|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~y$w_buff1~0_In-154880217 |ULTIMATE.start_main_#t~ite18_Out-154880217|)) (and (or .cse0 .cse1) (= ~y~0_In-154880217 |ULTIMATE.start_main_#t~ite18_Out-154880217|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-154880217, ~y~0=~y~0_In-154880217, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-154880217, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-154880217} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-154880217, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-154880217|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-154880217|, ~y~0=~y~0_In-154880217, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-154880217, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-154880217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 22:36:29,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1073968189 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1073968189 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1073968189 |ULTIMATE.start_main_#t~ite20_Out1073968189|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out1073968189|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1073968189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1073968189} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1073968189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1073968189, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1073968189|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:36:29,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1199310920 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1199310920 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1199310920 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1199310920 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1199310920 |ULTIMATE.start_main_#t~ite21_Out1199310920|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out1199310920|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1199310920, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1199310920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1199310920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1199310920} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1199310920, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1199310920, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1199310920|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1199310920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1199310920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:36:29,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-745822154 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-745822154 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-745822154| ~y$r_buff0_thd0~0_In-745822154)) (and (= |ULTIMATE.start_main_#t~ite22_Out-745822154| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-745822154, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-745822154} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-745822154, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-745822154, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-745822154|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:36:29,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In591008942 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In591008942 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In591008942 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In591008942 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite23_Out591008942| ~y$r_buff1_thd0~0_In591008942)) (and (= |ULTIMATE.start_main_#t~ite23_Out591008942| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In591008942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In591008942, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In591008942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591008942} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In591008942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In591008942, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In591008942, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out591008942|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591008942} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:36:29,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In34610876 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_In34610876| |ULTIMATE.start_main_#t~ite29_Out34610876|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out34610876| ~y$w_buff0~0_In34610876)) (and .cse0 (= |ULTIMATE.start_main_#t~ite29_Out34610876| |ULTIMATE.start_main_#t~ite30_Out34610876|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In34610876 256)))) (or (= (mod ~y$w_buff0_used~0_In34610876 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In34610876 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In34610876 256) 0)))) (= |ULTIMATE.start_main_#t~ite29_Out34610876| ~y$w_buff0~0_In34610876)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In34610876, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In34610876|, ~y$w_buff0~0=~y$w_buff0~0_In34610876, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In34610876, ~weak$$choice2~0=~weak$$choice2~0_In34610876, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In34610876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In34610876} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out34610876|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In34610876, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out34610876|, ~y$w_buff0~0=~y$w_buff0~0_In34610876, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In34610876, ~weak$$choice2~0=~weak$$choice2~0_In34610876, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In34610876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In34610876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 22:36:29,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1836521524 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_In1836521524| |ULTIMATE.start_main_#t~ite35_Out1836521524|) (= |ULTIMATE.start_main_#t~ite36_Out1836521524| ~y$w_buff0_used~0_In1836521524) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite35_Out1836521524| |ULTIMATE.start_main_#t~ite36_Out1836521524|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1836521524 256)))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In1836521524 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1836521524 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In1836521524 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite35_Out1836521524| ~y$w_buff0_used~0_In1836521524)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1836521524, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1836521524, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1836521524|, ~weak$$choice2~0=~weak$$choice2~0_In1836521524, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1836521524, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1836521524} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1836521524, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1836521524, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1836521524|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1836521524|, ~weak$$choice2~0=~weak$$choice2~0_In1836521524, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1836521524, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1836521524} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-26 22:36:29,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1852909329 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_In-1852909329| |ULTIMATE.start_main_#t~ite38_Out-1852909329|) (= |ULTIMATE.start_main_#t~ite39_Out-1852909329| ~y$w_buff1_used~0_In-1852909329) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1852909329| |ULTIMATE.start_main_#t~ite38_Out-1852909329|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1852909329 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1852909329 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1852909329 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1852909329 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out-1852909329| ~y$w_buff1_used~0_In-1852909329) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1852909329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1852909329, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1852909329|, ~weak$$choice2~0=~weak$$choice2~0_In-1852909329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1852909329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1852909329} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1852909329, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1852909329|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1852909329, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1852909329|, ~weak$$choice2~0=~weak$$choice2~0_In-1852909329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1852909329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1852909329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:36:29,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} 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-26 22:36:29,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1981881564 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1981881564| ~y$r_buff1_thd0~0_In1981881564) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1981881564 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In1981881564 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1981881564 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1981881564 256)) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite44_Out1981881564| |ULTIMATE.start_main_#t~ite45_Out1981881564|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1981881564| ~y$r_buff1_thd0~0_In1981881564) (= |ULTIMATE.start_main_#t~ite44_In1981881564| |ULTIMATE.start_main_#t~ite44_Out1981881564|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1981881564, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1981881564, ~weak$$choice2~0=~weak$$choice2~0_In1981881564, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1981881564, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1981881564, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In1981881564|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1981881564, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1981881564, ~weak$$choice2~0=~weak$$choice2~0_In1981881564, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1981881564, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1981881564|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1981881564|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1981881564} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:36:29,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, 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-26 22:36:29,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:36:29,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:36:29 BasicIcfg [2019-12-26 22:36:29,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:36:29,405 INFO L168 Benchmark]: Toolchain (without parser) took 23971.79 ms. Allocated memory was 138.9 MB in the beginning and 1.1 GB in the end (delta: 922.2 MB). Free memory was 102.0 MB in the beginning and 779.6 MB in the end (delta: -677.6 MB). Peak memory consumption was 745.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:36:29,406 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:36:29,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.65 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 156.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:36:29,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.03 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:36:29,412 INFO L168 Benchmark]: Boogie Preprocessor took 40.73 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:36:29,412 INFO L168 Benchmark]: RCFGBuilder took 863.87 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 104.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:36:29,414 INFO L168 Benchmark]: TraceAbstraction took 22266.05 ms. Allocated memory was 203.4 MB in the beginning and 1.1 GB in the end (delta: 857.7 MB). Free memory was 104.0 MB in the beginning and 779.6 MB in the end (delta: -675.6 MB). Peak memory consumption was 683.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:36:29,421 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.48 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.65 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 156.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.03 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.73 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 863.87 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 104.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22266.05 ms. Allocated memory was 203.4 MB in the beginning and 1.1 GB in the end (delta: 857.7 MB). Free memory was 104.0 MB in the beginning and 779.6 MB in the end (delta: -675.6 MB). Peak memory consumption was 683.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L814] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L816] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L833] 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_p0_EAX=0, __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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L833] 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) [L834] 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)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L835] 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)) [L836] 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)) [L837] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1566 SDtfs, 1911 SDslu, 4178 SDs, 0 SdLazy, 2873 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 14376 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 110661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...