/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:20:09,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:20:09,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:20:09,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:20:09,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:20:09,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:20:09,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:20:09,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:20:09,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:20:09,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:20:09,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:20:09,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:20:09,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:20:09,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:20:09,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:20:09,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:20:09,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:20:09,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:20:09,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:20:09,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:20:09,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:20:09,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:20:09,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:20:09,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:20:09,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:20:09,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:20:09,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:20:09,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:20:09,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:20:09,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:20:09,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:20:09,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:20:09,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:20:09,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:20:09,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:20:09,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:20:09,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:20:09,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:20:09,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:20:09,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:20:09,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:20:09,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:20:09,230 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:20:09,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:20:09,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:20:09,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:20:09,232 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:20:09,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:20:09,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:20:09,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:20:09,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:20:09,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:20:09,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:20:09,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:20:09,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:20:09,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:20:09,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:20:09,233 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:20:09,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:20:09,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:20:09,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:20:09,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:20:09,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:20:09,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:20:09,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:20:09,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:20:09,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:20:09,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:20:09,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:20:09,236 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:20:09,236 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:20:09,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:20:09,236 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:20:09,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:20:09,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:20:09,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:20:09,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:20:09,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:20:09,575 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:20:09,576 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2019-12-27 22:20:09,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8e73aed/daaccb9bab874a31b925a0f2173260bd/FLAGa7c99d6ff [2019-12-27 22:20:10,197 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:20:10,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2019-12-27 22:20:10,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8e73aed/daaccb9bab874a31b925a0f2173260bd/FLAGa7c99d6ff [2019-12-27 22:20:10,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8e73aed/daaccb9bab874a31b925a0f2173260bd [2019-12-27 22:20:10,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:20:10,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:20:10,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:20:10,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:20:10,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:20:10,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:20:10" (1/1) ... [2019-12-27 22:20:10,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:10, skipping insertion in model container [2019-12-27 22:20:10,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:20:10" (1/1) ... [2019-12-27 22:20:10,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:20:10,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:20:11,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:20:11,171 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:20:11,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:20:11,310 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:20:11,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11 WrapperNode [2019-12-27 22:20:11,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:20:11,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:20:11,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:20:11,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:20:11,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:20:11,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:20:11,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:20:11,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:20:11,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... [2019-12-27 22:20:11,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:20:11,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:20:11,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:20:11,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:20:11,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:20:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:20:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:20:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:20:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:20:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:20:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:20:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:20:11,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:20:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:20:11,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:20:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:20:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:20:11,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:20:11,502 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:20:12,277 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:20:12,278 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:20:12,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:20:12 BoogieIcfgContainer [2019-12-27 22:20:12,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:20:12,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:20:12,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:20:12,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:20:12,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:20:10" (1/3) ... [2019-12-27 22:20:12,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116308ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:20:12, skipping insertion in model container [2019-12-27 22:20:12,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:11" (2/3) ... [2019-12-27 22:20:12,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116308ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:20:12, skipping insertion in model container [2019-12-27 22:20:12,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:20:12" (3/3) ... [2019-12-27 22:20:12,289 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc.i [2019-12-27 22:20:12,299 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:20:12,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:20:12,311 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:20:12,312 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:20:12,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,371 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,371 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,410 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,410 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:12,427 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:20:12,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:20:12,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:20:12,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:20:12,446 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:20:12,446 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:20:12,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:20:12,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:20:12,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:20:12,465 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 22:20:12,467 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:20:12,585 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:20:12,586 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:20:12,600 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:20:12,620 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:20:12,678 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:20:12,678 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:20:12,687 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:20:12,707 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:20:12,708 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:20:16,052 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:20:16,180 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:20:16,210 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84694 [2019-12-27 22:20:16,210 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 22:20:16,214 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 111 transitions [2019-12-27 22:20:38,253 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129812 states. [2019-12-27 22:20:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 129812 states. [2019-12-27 22:20:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:20:38,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:20:38,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:20:38,262 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:20:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:20:38,267 INFO L82 PathProgramCache]: Analyzing trace with hash 841641, now seen corresponding path program 1 times [2019-12-27 22:20:38,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:20:38,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732983661] [2019-12-27 22:20:38,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:20:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:20:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:20:38,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732983661] [2019-12-27 22:20:38,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:20:38,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:20:38,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1060139046] [2019-12-27 22:20:38,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:20:38,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:20:38,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:20:38,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:20:38,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:20:38,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:20:38,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:20:38,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:20:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:20:38,567 INFO L87 Difference]: Start difference. First operand 129812 states. Second operand 3 states. [2019-12-27 22:20:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:20:42,379 INFO L93 Difference]: Finished difference Result 129324 states and 557563 transitions. [2019-12-27 22:20:42,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:20:42,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:20:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:20:43,191 INFO L225 Difference]: With dead ends: 129324 [2019-12-27 22:20:43,191 INFO L226 Difference]: Without dead ends: 126776 [2019-12-27 22:20:43,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:20:50,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126776 states. [2019-12-27 22:20:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126776 to 126776. [2019-12-27 22:20:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126776 states. [2019-12-27 22:20:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126776 states to 126776 states and 547175 transitions. [2019-12-27 22:20:57,551 INFO L78 Accepts]: Start accepts. Automaton has 126776 states and 547175 transitions. Word has length 3 [2019-12-27 22:20:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:20:57,551 INFO L462 AbstractCegarLoop]: Abstraction has 126776 states and 547175 transitions. [2019-12-27 22:20:57,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:20:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 126776 states and 547175 transitions. [2019-12-27 22:20:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:20:57,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:20:57,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:20:57,557 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:20:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:20:57,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1225155789, now seen corresponding path program 1 times [2019-12-27 22:20:57,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:20:57,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059367787] [2019-12-27 22:20:57,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:20:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:20:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:20:57,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059367787] [2019-12-27 22:20:57,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:20:57,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:20:57,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1281184070] [2019-12-27 22:20:57,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:20:57,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:20:57,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:20:57,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:20:57,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:20:57,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:20:57,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:20:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:20:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:20:57,717 INFO L87 Difference]: Start difference. First operand 126776 states and 547175 transitions. Second operand 4 states. [2019-12-27 22:21:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:04,351 INFO L93 Difference]: Finished difference Result 198216 states and 822018 transitions. [2019-12-27 22:21:04,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:04,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:21:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:05,215 INFO L225 Difference]: With dead ends: 198216 [2019-12-27 22:21:05,216 INFO L226 Difference]: Without dead ends: 198167 [2019-12-27 22:21:05,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198167 states. [2019-12-27 22:21:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198167 to 182118. [2019-12-27 22:21:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182118 states. [2019-12-27 22:21:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182118 states to 182118 states and 765134 transitions. [2019-12-27 22:21:15,765 INFO L78 Accepts]: Start accepts. Automaton has 182118 states and 765134 transitions. Word has length 11 [2019-12-27 22:21:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:15,767 INFO L462 AbstractCegarLoop]: Abstraction has 182118 states and 765134 transitions. [2019-12-27 22:21:15,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 182118 states and 765134 transitions. [2019-12-27 22:21:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:21:15,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:15,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:15,773 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1435968535, now seen corresponding path program 1 times [2019-12-27 22:21:15,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:15,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450971429] [2019-12-27 22:21:15,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:15,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450971429] [2019-12-27 22:21:15,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:15,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:15,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204142509] [2019-12-27 22:21:15,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:15,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:15,938 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:21:15,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:15,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:15,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:15,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:15,940 INFO L87 Difference]: Start difference. First operand 182118 states and 765134 transitions. Second operand 4 states. [2019-12-27 22:21:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:23,578 INFO L93 Difference]: Finished difference Result 260296 states and 1067327 transitions. [2019-12-27 22:21:23,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:23,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:21:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:24,314 INFO L225 Difference]: With dead ends: 260296 [2019-12-27 22:21:24,314 INFO L226 Difference]: Without dead ends: 260233 [2019-12-27 22:21:24,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260233 states. [2019-12-27 22:21:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260233 to 221154. [2019-12-27 22:21:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221154 states. [2019-12-27 22:21:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221154 states to 221154 states and 922215 transitions. [2019-12-27 22:21:46,082 INFO L78 Accepts]: Start accepts. Automaton has 221154 states and 922215 transitions. Word has length 13 [2019-12-27 22:21:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:46,082 INFO L462 AbstractCegarLoop]: Abstraction has 221154 states and 922215 transitions. [2019-12-27 22:21:46,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 221154 states and 922215 transitions. [2019-12-27 22:21:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:21:46,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:46,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:46,086 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:46,086 INFO L82 PathProgramCache]: Analyzing trace with hash 472638345, now seen corresponding path program 1 times [2019-12-27 22:21:46,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:46,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104875868] [2019-12-27 22:21:46,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:46,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104875868] [2019-12-27 22:21:46,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:46,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:46,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1512763457] [2019-12-27 22:21:46,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:46,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:46,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:21:46,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:46,143 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:46,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:21:46,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:21:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:46,144 INFO L87 Difference]: Start difference. First operand 221154 states and 922215 transitions. Second operand 3 states. [2019-12-27 22:21:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:46,301 INFO L93 Difference]: Finished difference Result 42754 states and 139696 transitions. [2019-12-27 22:21:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:46,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:21:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:46,372 INFO L225 Difference]: With dead ends: 42754 [2019-12-27 22:21:46,372 INFO L226 Difference]: Without dead ends: 42754 [2019-12-27 22:21:46,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-12-27 22:21:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754. [2019-12-27 22:21:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42754 states. [2019-12-27 22:21:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 139696 transitions. [2019-12-27 22:21:48,833 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 139696 transitions. Word has length 13 [2019-12-27 22:21:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:48,833 INFO L462 AbstractCegarLoop]: Abstraction has 42754 states and 139696 transitions. [2019-12-27 22:21:48,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 139696 transitions. [2019-12-27 22:21:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:21:48,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:48,841 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-27 22:21:48,841 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:48,842 INFO L82 PathProgramCache]: Analyzing trace with hash -589628414, now seen corresponding path program 1 times [2019-12-27 22:21:48,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:48,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926644428] [2019-12-27 22:21:48,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:49,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926644428] [2019-12-27 22:21:49,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:49,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:49,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [788312222] [2019-12-27 22:21:49,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:49,017 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:49,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 37 transitions. [2019-12-27 22:21:49,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:49,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:49,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:21:49,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:21:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:49,023 INFO L87 Difference]: Start difference. First operand 42754 states and 139696 transitions. Second operand 5 states. [2019-12-27 22:21:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:49,924 INFO L93 Difference]: Finished difference Result 57358 states and 183378 transitions. [2019-12-27 22:21:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:21:49,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:21:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:50,021 INFO L225 Difference]: With dead ends: 57358 [2019-12-27 22:21:50,022 INFO L226 Difference]: Without dead ends: 57345 [2019-12-27 22:21:50,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:21:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57345 states. [2019-12-27 22:21:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57345 to 43244. [2019-12-27 22:21:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43244 states. [2019-12-27 22:21:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43244 states to 43244 states and 140907 transitions. [2019-12-27 22:21:52,036 INFO L78 Accepts]: Start accepts. Automaton has 43244 states and 140907 transitions. Word has length 19 [2019-12-27 22:21:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:52,037 INFO L462 AbstractCegarLoop]: Abstraction has 43244 states and 140907 transitions. [2019-12-27 22:21:52,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:21:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 43244 states and 140907 transitions. [2019-12-27 22:21:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:21:52,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:52,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:52,050 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1356407650, now seen corresponding path program 1 times [2019-12-27 22:21:52,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:52,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205949150] [2019-12-27 22:21:52,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:52,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205949150] [2019-12-27 22:21:52,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:52,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:52,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974201218] [2019-12-27 22:21:52,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:52,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:52,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:21:52,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:52,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:52,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:52,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:52,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:52,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:52,126 INFO L87 Difference]: Start difference. First operand 43244 states and 140907 transitions. Second operand 4 states. [2019-12-27 22:21:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:52,171 INFO L93 Difference]: Finished difference Result 8037 states and 21818 transitions. [2019-12-27 22:21:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:21:52,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:21:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:52,182 INFO L225 Difference]: With dead ends: 8037 [2019-12-27 22:21:52,183 INFO L226 Difference]: Without dead ends: 8037 [2019-12-27 22:21:52,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2019-12-27 22:21:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 7897. [2019-12-27 22:21:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 22:21:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 21446 transitions. [2019-12-27 22:21:52,287 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 21446 transitions. Word has length 25 [2019-12-27 22:21:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:52,287 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 21446 transitions. [2019-12-27 22:21:52,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 21446 transitions. [2019-12-27 22:21:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:21:52,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:52,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:52,301 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1453764539, now seen corresponding path program 1 times [2019-12-27 22:21:52,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:52,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911801146] [2019-12-27 22:21:52,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:52,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911801146] [2019-12-27 22:21:52,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:52,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:21:52,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1777345058] [2019-12-27 22:21:52,387 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:52,395 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:52,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 92 transitions. [2019-12-27 22:21:52,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:52,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:21:52,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:21:52,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:21:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:52,425 INFO L87 Difference]: Start difference. First operand 7897 states and 21446 transitions. Second operand 5 states. [2019-12-27 22:21:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:52,459 INFO L93 Difference]: Finished difference Result 5718 states and 16246 transitions. [2019-12-27 22:21:52,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:52,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:21:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:52,467 INFO L225 Difference]: With dead ends: 5718 [2019-12-27 22:21:52,467 INFO L226 Difference]: Without dead ends: 5314 [2019-12-27 22:21:52,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2019-12-27 22:21:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4950. [2019-12-27 22:21:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 22:21:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14287 transitions. [2019-12-27 22:21:52,542 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14287 transitions. Word has length 37 [2019-12-27 22:21:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:52,542 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14287 transitions. [2019-12-27 22:21:52,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:21:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14287 transitions. [2019-12-27 22:21:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:52,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:52,550 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:52,550 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1228802019, now seen corresponding path program 1 times [2019-12-27 22:21:52,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:52,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969029835] [2019-12-27 22:21:52,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:52,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969029835] [2019-12-27 22:21:52,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:52,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:52,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1664698089] [2019-12-27 22:21:52,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:52,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:52,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 22:21:52,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:52,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:52,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:21:52,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:52,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:21:52,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:52,781 INFO L87 Difference]: Start difference. First operand 4950 states and 14287 transitions. Second operand 3 states. [2019-12-27 22:21:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:52,843 INFO L93 Difference]: Finished difference Result 4959 states and 14296 transitions. [2019-12-27 22:21:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:52,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:21:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:52,852 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 22:21:52,852 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 22:21:52,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 22:21:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 22:21:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 22:21:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14292 transitions. [2019-12-27 22:21:52,920 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14292 transitions. Word has length 65 [2019-12-27 22:21:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:52,920 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14292 transitions. [2019-12-27 22:21:52,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14292 transitions. [2019-12-27 22:21:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:52,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:52,927 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:52,927 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash 320653868, now seen corresponding path program 1 times [2019-12-27 22:21:52,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:52,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049162488] [2019-12-27 22:21:52,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:53,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049162488] [2019-12-27 22:21:53,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:53,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:21:53,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215228717] [2019-12-27 22:21:53,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:53,058 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:54,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 22:21:54,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:55,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:21:55,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:21:55,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:55,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:21:55,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:21:55,045 INFO L87 Difference]: Start difference. First operand 4955 states and 14292 transitions. Second operand 10 states. [2019-12-27 22:21:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:55,633 INFO L93 Difference]: Finished difference Result 7546 states and 21557 transitions. [2019-12-27 22:21:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:21:55,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:21:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:55,645 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 22:21:55,645 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 22:21:55,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:21:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 22:21:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 22:21:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 22:21:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18327 transitions. [2019-12-27 22:21:55,740 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18327 transitions. Word has length 65 [2019-12-27 22:21:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:55,740 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18327 transitions. [2019-12-27 22:21:55,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:21:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18327 transitions. [2019-12-27 22:21:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:55,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:55,749 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:55,750 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2108512596, now seen corresponding path program 2 times [2019-12-27 22:21:55,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:55,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068573669] [2019-12-27 22:21:55,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:55,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068573669] [2019-12-27 22:21:55,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:55,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:21:55,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2043489267] [2019-12-27 22:21:55,860 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:55,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:56,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 357 transitions. [2019-12-27 22:21:56,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:56,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:21:56,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:21:56,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:56,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:21:56,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:56,065 INFO L87 Difference]: Start difference. First operand 6352 states and 18327 transitions. Second operand 5 states. [2019-12-27 22:21:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:56,436 INFO L93 Difference]: Finished difference Result 9350 states and 26643 transitions. [2019-12-27 22:21:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:21:56,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:21:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:56,452 INFO L225 Difference]: With dead ends: 9350 [2019-12-27 22:21:56,452 INFO L226 Difference]: Without dead ends: 9350 [2019-12-27 22:21:56,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:21:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9350 states. [2019-12-27 22:21:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9350 to 7014. [2019-12-27 22:21:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-27 22:21:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20305 transitions. [2019-12-27 22:21:56,574 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20305 transitions. Word has length 65 [2019-12-27 22:21:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:56,574 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20305 transitions. [2019-12-27 22:21:56,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:21:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20305 transitions. [2019-12-27 22:21:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:56,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:56,588 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:56,589 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash 27480750, now seen corresponding path program 3 times [2019-12-27 22:21:56,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:56,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540030807] [2019-12-27 22:21:56,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:56,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540030807] [2019-12-27 22:21:56,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:56,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:21:56,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856689460] [2019-12-27 22:21:56,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:56,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:56,817 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 310 transitions. [2019-12-27 22:21:56,818 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:56,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:21:56,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:21:56,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:56,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:21:56,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:21:56,930 INFO L87 Difference]: Start difference. First operand 7014 states and 20305 transitions. Second operand 11 states. [2019-12-27 22:21:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:59,147 INFO L93 Difference]: Finished difference Result 17056 states and 48283 transitions. [2019-12-27 22:21:59,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:21:59,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 22:21:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:59,168 INFO L225 Difference]: With dead ends: 17056 [2019-12-27 22:21:59,168 INFO L226 Difference]: Without dead ends: 17056 [2019-12-27 22:21:59,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:21:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2019-12-27 22:21:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 7595. [2019-12-27 22:21:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2019-12-27 22:21:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 22075 transitions. [2019-12-27 22:21:59,336 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 22075 transitions. Word has length 65 [2019-12-27 22:21:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:59,336 INFO L462 AbstractCegarLoop]: Abstraction has 7595 states and 22075 transitions. [2019-12-27 22:21:59,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:21:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 22075 transitions. [2019-12-27 22:21:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:59,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:59,346 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:59,347 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1465472054, now seen corresponding path program 4 times [2019-12-27 22:21:59,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:59,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020766026] [2019-12-27 22:21:59,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:59,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020766026] [2019-12-27 22:21:59,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:59,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:59,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [614616391] [2019-12-27 22:21:59,472 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:59,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:59,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 385 transitions. [2019-12-27 22:21:59,686 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:59,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:59,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:21:59,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:59,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:21:59,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:59,689 INFO L87 Difference]: Start difference. First operand 7595 states and 22075 transitions. Second operand 3 states. [2019-12-27 22:21:59,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:59,778 INFO L93 Difference]: Finished difference Result 7594 states and 22073 transitions. [2019-12-27 22:21:59,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:59,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:21:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:59,791 INFO L225 Difference]: With dead ends: 7594 [2019-12-27 22:21:59,791 INFO L226 Difference]: Without dead ends: 7594 [2019-12-27 22:21:59,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2019-12-27 22:21:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 4867. [2019-12-27 22:21:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2019-12-27 22:21:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 14413 transitions. [2019-12-27 22:21:59,934 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 14413 transitions. Word has length 65 [2019-12-27 22:21:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:59,934 INFO L462 AbstractCegarLoop]: Abstraction has 4867 states and 14413 transitions. [2019-12-27 22:21:59,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 14413 transitions. [2019-12-27 22:21:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:21:59,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:59,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:59,945 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:59,945 INFO L82 PathProgramCache]: Analyzing trace with hash -337801162, now seen corresponding path program 1 times [2019-12-27 22:21:59,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:59,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650465636] [2019-12-27 22:21:59,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:00,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650465636] [2019-12-27 22:22:00,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:00,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:00,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52612452] [2019-12-27 22:22:00,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:00,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:00,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 358 transitions. [2019-12-27 22:22:00,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:00,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:22:00,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:00,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:00,227 INFO L87 Difference]: Start difference. First operand 4867 states and 14413 transitions. Second operand 5 states. [2019-12-27 22:22:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:00,450 INFO L93 Difference]: Finished difference Result 5900 states and 16829 transitions. [2019-12-27 22:22:00,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:22:00,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 22:22:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:00,459 INFO L225 Difference]: With dead ends: 5900 [2019-12-27 22:22:00,459 INFO L226 Difference]: Without dead ends: 5900 [2019-12-27 22:22:00,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5900 states. [2019-12-27 22:22:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5900 to 3739. [2019-12-27 22:22:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-27 22:22:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-27 22:22:00,563 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 66 [2019-12-27 22:22:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:00,563 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-27 22:22:00,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-27 22:22:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:00,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:00,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:00,569 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:00,569 INFO L82 PathProgramCache]: Analyzing trace with hash -347351168, now seen corresponding path program 1 times [2019-12-27 22:22:00,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:00,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550107201] [2019-12-27 22:22:00,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:00,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550107201] [2019-12-27 22:22:00,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:00,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:22:00,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074583968] [2019-12-27 22:22:00,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:00,701 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:00,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 400 transitions. [2019-12-27 22:22:00,862 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:01,007 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:22:01,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:22:01,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:22:01,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:22:01,009 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 11 states. [2019-12-27 22:22:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:01,989 INFO L93 Difference]: Finished difference Result 6465 states and 18382 transitions. [2019-12-27 22:22:01,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:22:01,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 22:22:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:02,000 INFO L225 Difference]: With dead ends: 6465 [2019-12-27 22:22:02,000 INFO L226 Difference]: Without dead ends: 6465 [2019-12-27 22:22:02,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:22:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2019-12-27 22:22:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 3739. [2019-12-27 22:22:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-27 22:22:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-27 22:22:02,076 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 67 [2019-12-27 22:22:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:02,076 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-27 22:22:02,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:22:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-27 22:22:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:02,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:02,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:02,082 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:02,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1909324032, now seen corresponding path program 2 times [2019-12-27 22:22:02,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:02,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093185237] [2019-12-27 22:22:02,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:02,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093185237] [2019-12-27 22:22:02,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:02,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:02,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808229954] [2019-12-27 22:22:02,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:02,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:02,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 400 transitions. [2019-12-27 22:22:02,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:02,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:22:02,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:22:02,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:02,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:22:02,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:22:02,389 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 6 states. [2019-12-27 22:22:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:02,604 INFO L93 Difference]: Finished difference Result 4613 states and 12870 transitions. [2019-12-27 22:22:02,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:02,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 22:22:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:02,611 INFO L225 Difference]: With dead ends: 4613 [2019-12-27 22:22:02,611 INFO L226 Difference]: Without dead ends: 4613 [2019-12-27 22:22:02,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4613 states. [2019-12-27 22:22:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4613 to 2989. [2019-12-27 22:22:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-27 22:22:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8460 transitions. [2019-12-27 22:22:02,665 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8460 transitions. Word has length 67 [2019-12-27 22:22:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:02,665 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8460 transitions. [2019-12-27 22:22:02,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:22:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8460 transitions. [2019-12-27 22:22:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:02,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:02,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:02,671 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash -620246542, now seen corresponding path program 1 times [2019-12-27 22:22:02,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:02,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689097696] [2019-12-27 22:22:02,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:02,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689097696] [2019-12-27 22:22:02,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:02,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:22:02,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029766883] [2019-12-27 22:22:02,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:02,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:03,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 460 transitions. [2019-12-27 22:22:03,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:22:03,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:22:03,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:03,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:03,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:03,801 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:22:03,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 22:22:03,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:03,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 22:22:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:22:03,803 INFO L87 Difference]: Start difference. First operand 2989 states and 8460 transitions. Second operand 23 states. [2019-12-27 22:22:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:05,720 INFO L93 Difference]: Finished difference Result 7639 states and 21426 transitions. [2019-12-27 22:22:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 22:22:05,721 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-12-27 22:22:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:05,729 INFO L225 Difference]: With dead ends: 7639 [2019-12-27 22:22:05,729 INFO L226 Difference]: Without dead ends: 3678 [2019-12-27 22:22:05,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:22:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2019-12-27 22:22:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 2817. [2019-12-27 22:22:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-27 22:22:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7945 transitions. [2019-12-27 22:22:05,799 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7945 transitions. Word has length 68 [2019-12-27 22:22:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:05,799 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7945 transitions. [2019-12-27 22:22:05,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 22:22:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7945 transitions. [2019-12-27 22:22:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:05,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:05,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:05,807 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1307128750, now seen corresponding path program 2 times [2019-12-27 22:22:05,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:05,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158551886] [2019-12-27 22:22:05,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:06,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158551886] [2019-12-27 22:22:06,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:06,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:22:06,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [195609165] [2019-12-27 22:22:06,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:06,189 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:06,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 538 transitions. [2019-12-27 22:22:06,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:06,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:06,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:07,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 22:22:07,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:22:07,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:07,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:22:07,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:22:07,067 INFO L87 Difference]: Start difference. First operand 2817 states and 7945 transitions. Second operand 20 states. [2019-12-27 22:22:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:08,122 INFO L93 Difference]: Finished difference Result 5574 states and 15703 transitions. [2019-12-27 22:22:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:22:08,123 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 22:22:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:08,131 INFO L225 Difference]: With dead ends: 5574 [2019-12-27 22:22:08,131 INFO L226 Difference]: Without dead ends: 5542 [2019-12-27 22:22:08,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:22:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5542 states. [2019-12-27 22:22:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5542 to 3948. [2019-12-27 22:22:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-27 22:22:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11039 transitions. [2019-12-27 22:22:08,198 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11039 transitions. Word has length 68 [2019-12-27 22:22:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:08,199 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 11039 transitions. [2019-12-27 22:22:08,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:22:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11039 transitions. [2019-12-27 22:22:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:08,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:08,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:08,203 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1086450056, now seen corresponding path program 3 times [2019-12-27 22:22:08,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:08,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272011385] [2019-12-27 22:22:08,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:08,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272011385] [2019-12-27 22:22:08,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:08,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:22:08,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462541420] [2019-12-27 22:22:08,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:08,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:08,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 522 transitions. [2019-12-27 22:22:08,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:09,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:09,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:09,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 22:22:09,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:22:09,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:22:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:22:09,107 INFO L87 Difference]: Start difference. First operand 3948 states and 11039 transitions. Second operand 20 states. [2019-12-27 22:22:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:10,373 INFO L93 Difference]: Finished difference Result 7046 states and 19795 transitions. [2019-12-27 22:22:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:22:10,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 22:22:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:10,386 INFO L225 Difference]: With dead ends: 7046 [2019-12-27 22:22:10,386 INFO L226 Difference]: Without dead ends: 7014 [2019-12-27 22:22:10,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:22:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2019-12-27 22:22:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 4160. [2019-12-27 22:22:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-27 22:22:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11656 transitions. [2019-12-27 22:22:10,461 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11656 transitions. Word has length 68 [2019-12-27 22:22:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:10,461 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11656 transitions. [2019-12-27 22:22:10,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:22:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11656 transitions. [2019-12-27 22:22:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:10,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:10,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:10,466 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1871389806, now seen corresponding path program 4 times [2019-12-27 22:22:10,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:10,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660533969] [2019-12-27 22:22:10,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:10,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660533969] [2019-12-27 22:22:10,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:10,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:22:10,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1828423779] [2019-12-27 22:22:10,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:10,834 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:11,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 22:22:11,117 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:11,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:11,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:11,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 22:22:11,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 22:22:11,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 22:22:11,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:22:11,856 INFO L87 Difference]: Start difference. First operand 4160 states and 11656 transitions. Second operand 23 states. [2019-12-27 22:22:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:13,805 INFO L93 Difference]: Finished difference Result 7255 states and 20090 transitions. [2019-12-27 22:22:13,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 22:22:13,805 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-12-27 22:22:13,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:13,817 INFO L225 Difference]: With dead ends: 7255 [2019-12-27 22:22:13,817 INFO L226 Difference]: Without dead ends: 7223 [2019-12-27 22:22:13,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 20 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=456, Invalid=1706, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 22:22:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7223 states. [2019-12-27 22:22:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7223 to 4468. [2019-12-27 22:22:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4468 states. [2019-12-27 22:22:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 12519 transitions. [2019-12-27 22:22:13,913 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 12519 transitions. Word has length 68 [2019-12-27 22:22:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:13,913 INFO L462 AbstractCegarLoop]: Abstraction has 4468 states and 12519 transitions. [2019-12-27 22:22:13,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 22:22:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 12519 transitions. [2019-12-27 22:22:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:13,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:13,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:13,918 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 768786536, now seen corresponding path program 5 times [2019-12-27 22:22:13,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:13,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746651030] [2019-12-27 22:22:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:14,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746651030] [2019-12-27 22:22:14,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:14,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 22:22:14,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [180155030] [2019-12-27 22:22:14,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:14,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:14,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 267 states and 529 transitions. [2019-12-27 22:22:14,782 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:15,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:15,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 22:22:15,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 22:22:15,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 22:22:15,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:22:15,406 INFO L87 Difference]: Start difference. First operand 4468 states and 12519 transitions. Second operand 23 states. [2019-12-27 22:22:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:17,379 INFO L93 Difference]: Finished difference Result 8518 states and 23935 transitions. [2019-12-27 22:22:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 22:22:17,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-12-27 22:22:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:17,392 INFO L225 Difference]: With dead ends: 8518 [2019-12-27 22:22:17,392 INFO L226 Difference]: Without dead ends: 8486 [2019-12-27 22:22:17,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 16 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=400, Invalid=1670, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 22:22:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2019-12-27 22:22:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4561. [2019-12-27 22:22:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4561 states. [2019-12-27 22:22:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 12796 transitions. [2019-12-27 22:22:17,481 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 12796 transitions. Word has length 68 [2019-12-27 22:22:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:17,481 INFO L462 AbstractCegarLoop]: Abstraction has 4561 states and 12796 transitions. [2019-12-27 22:22:17,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 22:22:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 12796 transitions. [2019-12-27 22:22:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:17,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:17,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:17,486 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash 158566424, now seen corresponding path program 6 times [2019-12-27 22:22:17,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:17,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850763769] [2019-12-27 22:22:17,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:22:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:22:17,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:22:17,609 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:22:17,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_20 0) (= |v_#NULL.offset_3| 0) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1961~0.base_22| 1)) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_15) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1961~0.base_22|) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1961~0.base_22| 4)) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$r_buff1_thd2~0_16) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1961~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1961~0.base_22|) |v_ULTIMATE.start_main_~#t1961~0.offset_16| 0)) |v_#memory_int_21|) (= 0 v_~y~0_8) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$r_buff1_thd1~0_19) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1961~0.base_22|)) (= |v_ULTIMATE.start_main_~#t1961~0.offset_16| 0) (= v_~z$r_buff0_thd0~0_77 0) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$r_buff1_thd0~0_46) (= v_~z~0_29 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_~#t1961~0.offset=|v_ULTIMATE.start_main_~#t1961~0.offset_16|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_~#t1963~0.base=|v_ULTIMATE.start_main_~#t1963~0.base_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_~#t1963~0.offset=|v_ULTIMATE.start_main_~#t1963~0.offset_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ULTIMATE.start_main_~#t1962~0.base=|v_ULTIMATE.start_main_~#t1962~0.base_20|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1961~0.base=|v_ULTIMATE.start_main_~#t1961~0.base_22|, ULTIMATE.start_main_~#t1962~0.offset=|v_ULTIMATE.start_main_~#t1962~0.offset_15|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1961~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1963~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1963~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1962~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1961~0.base, ULTIMATE.start_main_~#t1962~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:22:17,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L807-1-->L809: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1962~0.base_11| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1962~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1962~0.base_11|) |v_ULTIMATE.start_main_~#t1962~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1962~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1962~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1962~0.offset_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1962~0.base_11|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1962~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1962~0.offset=|v_ULTIMATE.start_main_~#t1962~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1962~0.base=|v_ULTIMATE.start_main_~#t1962~0.base_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1962~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1962~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 22:22:17,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (= (mod v_~z$w_buff1_used~0_56 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_89 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_56)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 22:22:17,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1963~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1963~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1963~0.base_12|) |v_ULTIMATE.start_main_~#t1963~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1963~0.base_12| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1963~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1963~0.base_12| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1963~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1963~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1963~0.offset=|v_ULTIMATE.start_main_~#t1963~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1963~0.base=|v_ULTIMATE.start_main_~#t1963~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1963~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1963~0.base] because there is no mapped edge [2019-12-27 22:22:17,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In51588138 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In51588138 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out51588138| ~z$w_buff0_used~0_In51588138)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out51588138| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In51588138, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In51588138} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out51588138|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In51588138, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In51588138} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:22:17,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In41949740 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In41949740 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In41949740 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In41949740 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In41949740 |P0Thread1of1ForFork0_#t~ite6_Out41949740|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out41949740|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In41949740, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In41949740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In41949740, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In41949740} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out41949740|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In41949740, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In41949740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In41949740, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In41949740} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:22:17,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1284481375 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1284481375 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1284481375 ~z$r_buff0_thd1~0_Out1284481375)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1284481375) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1284481375, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1284481375} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1284481375, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1284481375|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1284481375} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:22:17,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In100487237 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In100487237 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In100487237 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In100487237 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out100487237| ~z$r_buff1_thd1~0_In100487237) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out100487237| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In100487237, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In100487237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In100487237, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In100487237} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In100487237, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out100487237|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In100487237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In100487237, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In100487237} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:22:17,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L748-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:22:17,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-198070023 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-198070023 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-198070023 |P1Thread1of1ForFork1_#t~ite9_Out-198070023|)) (and (not .cse1) (= ~z$w_buff1~0_In-198070023 |P1Thread1of1ForFork1_#t~ite9_Out-198070023|) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-198070023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-198070023, ~z$w_buff1~0=~z$w_buff1~0_In-198070023, ~z~0=~z~0_In-198070023} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-198070023|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-198070023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-198070023, ~z$w_buff1~0=~z$w_buff1~0_In-198070023, ~z~0=~z~0_In-198070023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:22:17,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 22:22:17,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1113759030 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1113759030 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1113759030|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1113759030| ~z$w_buff0_used~0_In-1113759030) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113759030, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1113759030} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113759030, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1113759030|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1113759030} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:22:17,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1761619350 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1761619350 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1761619350| ~z~0_In1761619350)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1761619350| ~z$w_buff1~0_In1761619350) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1761619350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1761619350, ~z$w_buff1~0=~z$w_buff1~0_In1761619350, ~z~0=~z~0_In1761619350} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1761619350|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1761619350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1761619350, ~z$w_buff1~0=~z$w_buff1~0_In1761619350, ~z~0=~z~0_In1761619350} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:22:17,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1704484546 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1704484546 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1704484546 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1704484546 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1704484546|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1704484546 |P1Thread1of1ForFork1_#t~ite12_Out1704484546|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1704484546, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1704484546, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704484546, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1704484546} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1704484546, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1704484546, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704484546, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1704484546|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1704484546} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:22:17,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In956039513 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In956039513 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out956039513|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out956039513| ~z$r_buff0_thd2~0_In956039513)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In956039513, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In956039513} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In956039513, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out956039513|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In956039513} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:22:17,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:22:17,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In258137713 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In258137713 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out258137713|)) (and (= ~z$w_buff0_used~0_In258137713 |P2Thread1of1ForFork2_#t~ite17_Out258137713|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In258137713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In258137713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In258137713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In258137713, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out258137713|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:22:17,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1761689513 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1761689513 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1761689513 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1761689513 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1761689513|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1761689513 |P2Thread1of1ForFork2_#t~ite18_Out1761689513|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1761689513, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1761689513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1761689513, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1761689513} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1761689513, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1761689513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1761689513, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1761689513, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1761689513|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:22:17,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1865778322 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1865778322 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In1865778322 |P2Thread1of1ForFork2_#t~ite19_Out1865778322|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1865778322|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1865778322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1865778322} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1865778322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1865778322, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1865778322|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:22:17,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-76255799 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-76255799 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-76255799 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-76255799 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-76255799 |P2Thread1of1ForFork2_#t~ite20_Out-76255799|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-76255799| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-76255799, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-76255799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-76255799, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-76255799} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-76255799, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-76255799|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-76255799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-76255799, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-76255799} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:22:17,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:22:17,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In26663727 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In26663727 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In26663727 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In26663727 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In26663727 |P1Thread1of1ForFork1_#t~ite14_Out26663727|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out26663727|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In26663727, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In26663727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In26663727, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In26663727} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In26663727, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In26663727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In26663727, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out26663727|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In26663727} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:22:17,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_10 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:22:17,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:22:17,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1264625873 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1264625873 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1264625873| ~z~0_In1264625873) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out1264625873| ~z$w_buff1~0_In1264625873)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1264625873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264625873, ~z$w_buff1~0=~z$w_buff1~0_In1264625873, ~z~0=~z~0_In1264625873} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1264625873, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1264625873|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264625873, ~z$w_buff1~0=~z$w_buff1~0_In1264625873, ~z~0=~z~0_In1264625873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 22:22:17,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite24_7|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_6|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_6|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 22:22:17,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In634522565 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In634522565 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out634522565|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite26_Out634522565| ~z$w_buff0_used~0_In634522565)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In634522565, ~z$w_buff0_used~0=~z$w_buff0_used~0_In634522565} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In634522565, ~z$w_buff0_used~0=~z$w_buff0_used~0_In634522565, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out634522565|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:22:17,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In875252722 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In875252722 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In875252722 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In875252722 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out875252722| ~z$w_buff1_used~0_In875252722) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite27_Out875252722|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In875252722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In875252722, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In875252722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In875252722} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In875252722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In875252722, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In875252722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In875252722, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out875252722|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:22:17,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In220663219 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In220663219 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out220663219|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In220663219 |ULTIMATE.start_main_#t~ite28_Out220663219|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In220663219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In220663219} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In220663219, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out220663219|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In220663219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:22:17,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-1044761043 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1044761043 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1044761043 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1044761043 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-1044761043| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite29_Out-1044761043| ~z$r_buff1_thd0~0_In-1044761043) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1044761043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1044761043, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1044761043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1044761043} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1044761043, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1044761043|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1044761043, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1044761043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1044761043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:22:17,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:22:17,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L836-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_8 256)) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:22:17,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:22:17,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:22:17 BasicIcfg [2019-12-27 22:22:17,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:22:17,741 INFO L168 Benchmark]: Toolchain (without parser) took 127222.15 ms. Allocated memory was 137.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 22:22:17,741 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:22:17,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.39 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 154.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:17,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.82 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:17,743 INFO L168 Benchmark]: Boogie Preprocessor took 39.86 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:17,745 INFO L168 Benchmark]: RCFGBuilder took 858.64 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.0 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:17,746 INFO L168 Benchmark]: TraceAbstraction took 125457.82 ms. Allocated memory was 201.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 22:22:17,754 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.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.39 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 154.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.82 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.86 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 858.64 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.0 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125457.82 ms. Allocated memory was 201.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 98 ProgramPointsAfterwards, 212 TransitionsBefore, 111 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 5348 VarBasedMoverChecksPositive, 177 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84694 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 125.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 34.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3231 SDtfs, 5333 SDslu, 13589 SDs, 0 SdLazy, 9663 SolverSat, 475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 104 SyntacticMatches, 109 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221154occurred 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: 52.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 103955 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 308798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...