/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:34:18,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:34:18,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:34:18,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:34:18,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:34:18,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:34:18,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:34:18,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:34:18,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:34:18,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:34:18,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:34:18,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:34:18,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:34:18,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:34:18,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:34:18,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:34:18,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:34:18,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:34:18,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:34:18,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:34:18,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:34:18,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:34:18,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:34:18,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:34:18,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:34:18,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:34:18,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:34:18,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:34:18,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:34:18,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:34:18,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:34:18,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:34:18,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:34:18,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:34:18,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:34:18,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:34:18,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:34:18,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:34:18,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:34:18,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:34:18,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:34:18,175 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:34:18,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:34:18,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:34:18,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:34:18,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:34:18,201 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:34:18,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:34:18,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:34:18,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:34:18,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:34:18,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:34:18,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:34:18,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:34:18,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:34:18,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:34:18,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:34:18,204 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:34:18,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:34:18,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:34:18,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:34:18,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:34:18,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:34:18,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:34:18,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:34:18,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:34:18,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:34:18,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:34:18,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:34:18,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:34:18,207 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:34:18,207 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:34:18,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:34:18,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:34:18,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:34:18,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:34:18,537 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:34:18,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2019-12-18 14:34:18,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f23dfb8/7bf5d5d9fe064aeead40f6e8b4009a73/FLAG02e6e1e27 [2019-12-18 14:34:19,182 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:34:19,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2019-12-18 14:34:19,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f23dfb8/7bf5d5d9fe064aeead40f6e8b4009a73/FLAG02e6e1e27 [2019-12-18 14:34:19,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f23dfb8/7bf5d5d9fe064aeead40f6e8b4009a73 [2019-12-18 14:34:19,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:34:19,425 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:34:19,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:34:19,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:34:19,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:34:19,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:34:19" (1/1) ... [2019-12-18 14:34:19,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1edfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:19, skipping insertion in model container [2019-12-18 14:34:19,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:34:19" (1/1) ... [2019-12-18 14:34:19,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:34:19,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:34:20,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:34:20,124 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:34:20,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:34:20,251 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:34:20,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20 WrapperNode [2019-12-18 14:34:20,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:34:20,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:34:20,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:34:20,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:34:20,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:34:20,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:34:20,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:34:20,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:34:20,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... [2019-12-18 14:34:20,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:34:20,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:34:20,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:34:20,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:34:20,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:34:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:34:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:34:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:34:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:34:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:34:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:34:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:34:20,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:34:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:34:20,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:34:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:34:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:34:20,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:34:20,454 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:34:21,216 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:34:21,217 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:34:21,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:34:21 BoogieIcfgContainer [2019-12-18 14:34:21,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:34:21,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:34:21,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:34:21,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:34:21,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:34:19" (1/3) ... [2019-12-18 14:34:21,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a75237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:34:21, skipping insertion in model container [2019-12-18 14:34:21,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:20" (2/3) ... [2019-12-18 14:34:21,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a75237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:34:21, skipping insertion in model container [2019-12-18 14:34:21,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:34:21" (3/3) ... [2019-12-18 14:34:21,229 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_rmo.opt.i [2019-12-18 14:34:21,239 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:34:21,240 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:34:21,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:34:21,252 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:34:21,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,325 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,336 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,336 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,372 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,372 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:21,388 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:34:21,411 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:34:21,412 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:34:21,412 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:34:21,412 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:34:21,412 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:34:21,412 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:34:21,412 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:34:21,412 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:34:21,435 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 14:34:21,437 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:34:21,523 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:34:21,523 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:34:21,541 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. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:34:21,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:34:21,616 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:34:21,616 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:34:21,626 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. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:34:21,648 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 14:34:21,649 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:34:25,097 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-12-18 14:34:26,588 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:34:26,727 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:34:26,764 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-18 14:34:26,764 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 14:34:26,768 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-18 14:34:46,335 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-18 14:34:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-18 14:34:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:34:46,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:46,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:34:46,344 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-18 14:34:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-18 14:34:46,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:46,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888918713] [2019-12-18 14:34:46,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:34:46,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888918713] [2019-12-18 14:34:46,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:46,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:34:46,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908239132] [2019-12-18 14:34:46,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:46,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:46,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:46,603 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-18 14:34:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:49,561 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-18 14:34:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:49,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:34:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:50,466 INFO L225 Difference]: With dead ends: 115182 [2019-12-18 14:34:50,466 INFO L226 Difference]: Without dead ends: 112830 [2019-12-18 14:34:50,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-18 14:34:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-18 14:34:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-18 14:34:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-18 14:34:59,848 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-18 14:34:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:59,848 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-18 14:34:59,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-18 14:34:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:34:59,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:59,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:59,853 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-18 14:34:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-18 14:34:59,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:59,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949400559] [2019-12-18 14:34:59,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:00,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949400559] [2019-12-18 14:35:00,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:00,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:00,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569207105] [2019-12-18 14:35:00,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:35:00,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:00,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:35:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:00,006 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-18 14:35:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:05,165 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-18 14:35:05,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:35:05,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:35:05,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:05,901 INFO L225 Difference]: With dead ends: 176302 [2019-12-18 14:35:05,901 INFO L226 Difference]: Without dead ends: 176253 [2019-12-18 14:35:05,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-18 14:35:17,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-18 14:35:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-18 14:35:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-18 14:35:18,589 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-18 14:35:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:18,589 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-18 14:35:18,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-18 14:35:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:35:18,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:18,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:18,596 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-18 14:35:18,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-18 14:35:18,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:18,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983336030] [2019-12-18 14:35:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:18,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983336030] [2019-12-18 14:35:18,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:18,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:18,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929919093] [2019-12-18 14:35:18,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:35:18,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:18,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:35:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:18,669 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-18 14:35:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:25,365 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-18 14:35:25,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:35:25,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:35:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:26,015 INFO L225 Difference]: With dead ends: 228428 [2019-12-18 14:35:26,015 INFO L226 Difference]: Without dead ends: 228365 [2019-12-18 14:35:26,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-18 14:35:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-18 14:35:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-18 14:35:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-18 14:35:42,718 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-18 14:35:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:42,720 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-18 14:35:42,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-18 14:35:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:35:42,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:42,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:42,724 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-18 14:35:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-18 14:35:42,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:42,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171673797] [2019-12-18 14:35:42,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:42,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171673797] [2019-12-18 14:35:42,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:42,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:42,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624701988] [2019-12-18 14:35:42,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:42,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:42,815 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-18 14:35:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:42,958 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-18 14:35:42,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:42,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:35:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:43,018 INFO L225 Difference]: With dead ends: 38255 [2019-12-18 14:35:43,018 INFO L226 Difference]: Without dead ends: 38255 [2019-12-18 14:35:43,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-18 14:35:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-18 14:35:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-18 14:35:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-18 14:35:43,652 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-18 14:35:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:43,652 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-18 14:35:43,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-18 14:35:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:35:43,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:43,656 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-18 14:35:43,656 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-18 14:35:43,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-18 14:35:43,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:43,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096811812] [2019-12-18 14:35:43,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:43,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096811812] [2019-12-18 14:35:43,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:43,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:35:43,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916292845] [2019-12-18 14:35:43,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:43,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:43,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:43,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:43,746 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-18 14:35:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:44,508 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-18 14:35:44,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:35:44,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:35:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:44,591 INFO L225 Difference]: With dead ends: 51712 [2019-12-18 14:35:44,591 INFO L226 Difference]: Without dead ends: 51699 [2019-12-18 14:35:44,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:35:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-18 14:35:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-18 14:35:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-18 14:35:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-18 14:35:46,461 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-18 14:35:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:46,462 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-18 14:35:46,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-18 14:35:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:35:46,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:46,476 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-18 14:35:46,476 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-18 14:35:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:46,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-18 14:35:46,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:46,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265756162] [2019-12-18 14:35:46,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:46,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265756162] [2019-12-18 14:35:46,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:46,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:35:46,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585195577] [2019-12-18 14:35:46,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:35:46,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:46,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:35:46,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:46,532 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-18 14:35:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:46,575 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-18 14:35:46,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:35:46,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:35:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:46,588 INFO L225 Difference]: With dead ends: 7422 [2019-12-18 14:35:46,588 INFO L226 Difference]: Without dead ends: 7422 [2019-12-18 14:35:46,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-18 14:35:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-18 14:35:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-18 14:35:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-18 14:35:46,690 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-18 14:35:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:46,690 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-18 14:35:46,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-18 14:35:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:35:46,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:46,702 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-18 14:35:46,702 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-18 14:35:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-18 14:35:46,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:46,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409572249] [2019-12-18 14:35:46,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:46,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409572249] [2019-12-18 14:35:46,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:46,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:35:46,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035489092] [2019-12-18 14:35:46,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:46,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:46,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:46,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:46,784 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-18 14:35:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:46,824 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-18 14:35:46,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:35:46,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:35:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:46,831 INFO L225 Difference]: With dead ends: 5312 [2019-12-18 14:35:46,831 INFO L226 Difference]: Without dead ends: 5312 [2019-12-18 14:35:46,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-18 14:35:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-18 14:35:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-18 14:35:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-18 14:35:46,904 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-18 14:35:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:46,905 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-18 14:35:46,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-18 14:35:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:35:46,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:46,913 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-18 14:35:46,913 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-18 14:35:46,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-18 14:35:46,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:46,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162851392] [2019-12-18 14:35:46,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:47,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162851392] [2019-12-18 14:35:47,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:47,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:35:47,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682842302] [2019-12-18 14:35:47,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:47,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:47,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:47,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:47,042 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 5 states. [2019-12-18 14:35:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:47,366 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-18 14:35:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:35:47,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:35:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:47,378 INFO L225 Difference]: With dead ends: 7539 [2019-12-18 14:35:47,378 INFO L226 Difference]: Without dead ends: 7539 [2019-12-18 14:35:47,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:35:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-18 14:35:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-18 14:35:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-18 14:35:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-18 14:35:47,478 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-18 14:35:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:47,478 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-18 14:35:47,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-18 14:35:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:35:47,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:47,489 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-18 14:35:47,489 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-18 14:35:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-18 14:35:47,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:47,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44378635] [2019-12-18 14:35:47,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:47,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44378635] [2019-12-18 14:35:47,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:47,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:47,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039649238] [2019-12-18 14:35:47,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:47,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:47,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:47,597 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-18 14:35:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:47,630 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-18 14:35:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:47,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:35:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:47,639 INFO L225 Difference]: With dead ends: 5975 [2019-12-18 14:35:47,640 INFO L226 Difference]: Without dead ends: 5975 [2019-12-18 14:35:47,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-18 14:35:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-18 14:35:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-18 14:35:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-18 14:35:47,734 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-18 14:35:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:47,735 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-18 14:35:47,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-18 14:35:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:35:47,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:47,743 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-18 14:35:47,743 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-18 14:35:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-18 14:35:47,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:47,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806137022] [2019-12-18 14:35:47,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:47,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806137022] [2019-12-18 14:35:47,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:47,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:35:47,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132418218] [2019-12-18 14:35:47,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:47,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:47,849 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-18 14:35:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:48,199 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-18 14:35:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:35:48,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 14:35:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:48,212 INFO L225 Difference]: With dead ends: 8394 [2019-12-18 14:35:48,212 INFO L226 Difference]: Without dead ends: 8394 [2019-12-18 14:35:48,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:35:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-18 14:35:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-18 14:35:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-18 14:35:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-18 14:35:49,747 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-18 14:35:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:49,749 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-18 14:35:49,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-18 14:35:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:35:49,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:49,761 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-18 14:35:49,761 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-18 14:35:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:49,762 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-18 14:35:49,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:49,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062709921] [2019-12-18 14:35:49,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:49,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062709921] [2019-12-18 14:35:49,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:49,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:49,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314884679] [2019-12-18 14:35:49,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:49,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:49,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:49,919 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 3 states. [2019-12-18 14:35:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:49,954 INFO L93 Difference]: Finished difference Result 5518 states and 15469 transitions. [2019-12-18 14:35:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:49,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:35:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:49,964 INFO L225 Difference]: With dead ends: 5518 [2019-12-18 14:35:49,964 INFO L226 Difference]: Without dead ends: 5518 [2019-12-18 14:35:49,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-12-18 14:35:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5170. [2019-12-18 14:35:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-18 14:35:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 14519 transitions. [2019-12-18 14:35:50,072 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 14519 transitions. Word has length 66 [2019-12-18 14:35:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:50,072 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 14519 transitions. [2019-12-18 14:35:50,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 14519 transitions. [2019-12-18 14:35:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:35:50,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:50,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-18 14:35:50,082 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-18 14:35:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:50,083 INFO L82 PathProgramCache]: Analyzing trace with hash 991626200, now seen corresponding path program 1 times [2019-12-18 14:35:50,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:50,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704894019] [2019-12-18 14:35:50,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:50,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704894019] [2019-12-18 14:35:50,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:50,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:35:50,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344940705] [2019-12-18 14:35:50,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:35:50,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:35:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:35:50,317 INFO L87 Difference]: Start difference. First operand 5170 states and 14519 transitions. Second operand 9 states. [2019-12-18 14:35:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:51,318 INFO L93 Difference]: Finished difference Result 7557 states and 21020 transitions. [2019-12-18 14:35:51,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:35:51,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 14:35:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:51,330 INFO L225 Difference]: With dead ends: 7557 [2019-12-18 14:35:51,330 INFO L226 Difference]: Without dead ends: 7557 [2019-12-18 14:35:51,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:35:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states. [2019-12-18 14:35:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 5613. [2019-12-18 14:35:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-12-18 14:35:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 15757 transitions. [2019-12-18 14:35:51,415 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 15757 transitions. Word has length 67 [2019-12-18 14:35:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:51,415 INFO L462 AbstractCegarLoop]: Abstraction has 5613 states and 15757 transitions. [2019-12-18 14:35:51,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:35:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 15757 transitions. [2019-12-18 14:35:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:35:51,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:51,423 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-18 14:35:51,423 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-18 14:35:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1617265986, now seen corresponding path program 2 times [2019-12-18 14:35:51,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:51,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344764075] [2019-12-18 14:35:51,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:51,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344764075] [2019-12-18 14:35:51,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:51,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:51,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270419333] [2019-12-18 14:35:51,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:51,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:51,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:51,527 INFO L87 Difference]: Start difference. First operand 5613 states and 15757 transitions. Second operand 3 states. [2019-12-18 14:35:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:51,595 INFO L93 Difference]: Finished difference Result 5612 states and 15755 transitions. [2019-12-18 14:35:51,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:51,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:35:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:51,605 INFO L225 Difference]: With dead ends: 5612 [2019-12-18 14:35:51,606 INFO L226 Difference]: Without dead ends: 5612 [2019-12-18 14:35:51,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2019-12-18 14:35:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 2982. [2019-12-18 14:35:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-18 14:35:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 8451 transitions. [2019-12-18 14:35:51,704 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 8451 transitions. Word has length 67 [2019-12-18 14:35:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:51,705 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 8451 transitions. [2019-12-18 14:35:51,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 8451 transitions. [2019-12-18 14:35:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:51,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:51,712 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-18 14:35:51,712 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-18 14:35:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1277219082, now seen corresponding path program 1 times [2019-12-18 14:35:51,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:51,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381483550] [2019-12-18 14:35:51,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:52,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-18 14:35:52,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381483550] [2019-12-18 14:35:52,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:52,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:35:52,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548433464] [2019-12-18 14:35:52,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:35:52,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:52,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:35:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:35:52,046 INFO L87 Difference]: Start difference. First operand 2982 states and 8451 transitions. Second operand 13 states. [2019-12-18 14:35:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:52,705 INFO L93 Difference]: Finished difference Result 6310 states and 17817 transitions. [2019-12-18 14:35:52,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:35:52,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 14:35:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:52,711 INFO L225 Difference]: With dead ends: 6310 [2019-12-18 14:35:52,711 INFO L226 Difference]: Without dead ends: 3416 [2019-12-18 14:35:52,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:35:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2019-12-18 14:35:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 2810. [2019-12-18 14:35:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-18 14:35:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-18 14:35:52,752 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 68 [2019-12-18 14:35:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:52,752 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-18 14:35:52,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:35:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-18 14:35:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:52,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:52,756 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-18 14:35:52,756 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-18 14:35:52,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 2 times [2019-12-18 14:35:52,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:52,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119834162] [2019-12-18 14:35:52,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:53,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119834162] [2019-12-18 14:35:53,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:53,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 14:35:53,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766436810] [2019-12-18 14:35:53,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 14:35:53,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 14:35:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:35:53,415 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 23 states. [2019-12-18 14:35:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:59,647 INFO L93 Difference]: Finished difference Result 11805 states and 33186 transitions. [2019-12-18 14:35:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-18 14:35:59,648 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-12-18 14:35:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:59,665 INFO L225 Difference]: With dead ends: 11805 [2019-12-18 14:35:59,665 INFO L226 Difference]: Without dead ends: 11780 [2019-12-18 14:35:59,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2160 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1002, Invalid=6480, Unknown=0, NotChecked=0, Total=7482 [2019-12-18 14:35:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11780 states. [2019-12-18 14:35:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11780 to 4319. [2019-12-18 14:35:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4319 states. [2019-12-18 14:35:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 12153 transitions. [2019-12-18 14:35:59,775 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 12153 transitions. Word has length 68 [2019-12-18 14:35:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:59,775 INFO L462 AbstractCegarLoop]: Abstraction has 4319 states and 12153 transitions. [2019-12-18 14:35:59,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 14:35:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 12153 transitions. [2019-12-18 14:35:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:59,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:59,781 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-18 14:35:59,781 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-18 14:35:59,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash -243969052, now seen corresponding path program 3 times [2019-12-18 14:35:59,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:59,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039651965] [2019-12-18 14:35:59,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:00,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039651965] [2019-12-18 14:36:00,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:00,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:36:00,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118896569] [2019-12-18 14:36:00,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:36:00,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:00,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:36:00,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:36:00,014 INFO L87 Difference]: Start difference. First operand 4319 states and 12153 transitions. Second operand 13 states. [2019-12-18 14:36:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:00,585 INFO L93 Difference]: Finished difference Result 7106 states and 19980 transitions. [2019-12-18 14:36:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:36:00,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 14:36:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:00,594 INFO L225 Difference]: With dead ends: 7106 [2019-12-18 14:36:00,595 INFO L226 Difference]: Without dead ends: 7081 [2019-12-18 14:36:00,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:36:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7081 states. [2019-12-18 14:36:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7081 to 3941. [2019-12-18 14:36:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-12-18 14:36:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 11030 transitions. [2019-12-18 14:36:00,658 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 11030 transitions. Word has length 68 [2019-12-18 14:36:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:00,659 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 11030 transitions. [2019-12-18 14:36:00,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:36:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 11030 transitions. [2019-12-18 14:36:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:00,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:00,665 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-18 14:36:00,665 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-18 14:36:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 4 times [2019-12-18 14:36:00,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:00,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796097564] [2019-12-18 14:36:00,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:01,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796097564] [2019-12-18 14:36:01,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:01,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:36:01,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871485142] [2019-12-18 14:36:01,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:36:01,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:36:01,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:36:01,257 INFO L87 Difference]: Start difference. First operand 3941 states and 11030 transitions. Second operand 20 states. [2019-12-18 14:36:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:03,800 INFO L93 Difference]: Finished difference Result 11294 states and 31243 transitions. [2019-12-18 14:36:03,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 14:36:03,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-18 14:36:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:03,815 INFO L225 Difference]: With dead ends: 11294 [2019-12-18 14:36:03,815 INFO L226 Difference]: Without dead ends: 11269 [2019-12-18 14:36:03,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1313, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 14:36:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2019-12-18 14:36:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 4224. [2019-12-18 14:36:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4224 states. [2019-12-18 14:36:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 11812 transitions. [2019-12-18 14:36:03,916 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 11812 transitions. Word has length 68 [2019-12-18 14:36:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:03,916 INFO L462 AbstractCegarLoop]: Abstraction has 4224 states and 11812 transitions. [2019-12-18 14:36:03,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:36:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 11812 transitions. [2019-12-18 14:36:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:03,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:03,922 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-18 14:36:03,922 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-18 14:36:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash 221673766, now seen corresponding path program 5 times [2019-12-18 14:36:03,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:03,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29206827] [2019-12-18 14:36:03,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:04,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29206827] [2019-12-18 14:36:04,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:04,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:36:04,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927285396] [2019-12-18 14:36:04,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:36:04,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:36:04,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:36:04,386 INFO L87 Difference]: Start difference. First operand 4224 states and 11812 transitions. Second operand 19 states. [2019-12-18 14:36:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:07,743 INFO L93 Difference]: Finished difference Result 12133 states and 33910 transitions. [2019-12-18 14:36:07,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 14:36:07,748 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-18 14:36:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:07,765 INFO L225 Difference]: With dead ends: 12133 [2019-12-18 14:36:07,765 INFO L226 Difference]: Without dead ends: 12108 [2019-12-18 14:36:07,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=436, Invalid=2426, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 14:36:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12108 states. [2019-12-18 14:36:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12108 to 4262. [2019-12-18 14:36:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4262 states. [2019-12-18 14:36:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 11917 transitions. [2019-12-18 14:36:07,864 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 11917 transitions. Word has length 68 [2019-12-18 14:36:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:07,865 INFO L462 AbstractCegarLoop]: Abstraction has 4262 states and 11917 transitions. [2019-12-18 14:36:07,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:36:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 11917 transitions. [2019-12-18 14:36:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:07,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:07,869 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-18 14:36:07,869 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-18 14:36:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1022373756, now seen corresponding path program 6 times [2019-12-18 14:36:07,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:07,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430161220] [2019-12-18 14:36:07,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:08,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430161220] [2019-12-18 14:36:08,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:08,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:36:08,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278721018] [2019-12-18 14:36:08,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:36:08,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:08,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:36:08,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:36:08,060 INFO L87 Difference]: Start difference. First operand 4262 states and 11917 transitions. Second operand 12 states. [2019-12-18 14:36:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:08,531 INFO L93 Difference]: Finished difference Result 6604 states and 18351 transitions. [2019-12-18 14:36:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 14:36:08,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 14:36:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:08,540 INFO L225 Difference]: With dead ends: 6604 [2019-12-18 14:36:08,540 INFO L226 Difference]: Without dead ends: 6579 [2019-12-18 14:36:08,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:36:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2019-12-18 14:36:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 4162. [2019-12-18 14:36:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-12-18 14:36:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 11668 transitions. [2019-12-18 14:36:08,603 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 11668 transitions. Word has length 68 [2019-12-18 14:36:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:08,604 INFO L462 AbstractCegarLoop]: Abstraction has 4162 states and 11668 transitions. [2019-12-18 14:36:08,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:36:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 11668 transitions. [2019-12-18 14:36:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:08,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:08,607 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-18 14:36:08,607 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-18 14:36:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 7 times [2019-12-18 14:36:08,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:08,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659543652] [2019-12-18 14:36:08,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:09,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659543652] [2019-12-18 14:36:09,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:09,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:36:09,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352683848] [2019-12-18 14:36:09,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:36:09,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:09,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:36:09,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:36:09,073 INFO L87 Difference]: Start difference. First operand 4162 states and 11668 transitions. Second operand 18 states. [2019-12-18 14:36:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:11,452 INFO L93 Difference]: Finished difference Result 11007 states and 30716 transitions. [2019-12-18 14:36:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 14:36:11,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-18 14:36:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:11,466 INFO L225 Difference]: With dead ends: 11007 [2019-12-18 14:36:11,466 INFO L226 Difference]: Without dead ends: 10982 [2019-12-18 14:36:11,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=1750, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 14:36:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10982 states. [2019-12-18 14:36:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10982 to 4389. [2019-12-18 14:36:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2019-12-18 14:36:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 12291 transitions. [2019-12-18 14:36:11,563 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 12291 transitions. Word has length 68 [2019-12-18 14:36:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:11,563 INFO L462 AbstractCegarLoop]: Abstraction has 4389 states and 12291 transitions. [2019-12-18 14:36:11,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:36:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 12291 transitions. [2019-12-18 14:36:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:11,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:11,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, 1] [2019-12-18 14:36:11,568 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-18 14:36:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -450226916, now seen corresponding path program 8 times [2019-12-18 14:36:11,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:11,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752812157] [2019-12-18 14:36:11,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:12,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752812157] [2019-12-18 14:36:12,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:12,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:36:12,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104149039] [2019-12-18 14:36:12,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:36:12,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:12,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:36:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:36:12,048 INFO L87 Difference]: Start difference. First operand 4389 states and 12291 transitions. Second operand 18 states. [2019-12-18 14:36:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:15,108 INFO L93 Difference]: Finished difference Result 12857 states and 35721 transitions. [2019-12-18 14:36:15,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 14:36:15,109 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-18 14:36:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:15,125 INFO L225 Difference]: With dead ends: 12857 [2019-12-18 14:36:15,125 INFO L226 Difference]: Without dead ends: 12832 [2019-12-18 14:36:15,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=428, Invalid=2542, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 14:36:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12832 states. [2019-12-18 14:36:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12832 to 4599. [2019-12-18 14:36:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2019-12-18 14:36:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 12919 transitions. [2019-12-18 14:36:15,235 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 12919 transitions. Word has length 68 [2019-12-18 14:36:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:15,235 INFO L462 AbstractCegarLoop]: Abstraction has 4599 states and 12919 transitions. [2019-12-18 14:36:15,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:36:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 12919 transitions. [2019-12-18 14:36:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:15,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:15,240 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-18 14:36:15,240 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash 932771090, now seen corresponding path program 9 times [2019-12-18 14:36:15,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:15,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723818797] [2019-12-18 14:36:15,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:15,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723818797] [2019-12-18 14:36:15,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:15,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:36:15,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424455362] [2019-12-18 14:36:15,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:36:15,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:36:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:36:15,753 INFO L87 Difference]: Start difference. First operand 4599 states and 12919 transitions. Second operand 20 states. [2019-12-18 14:36:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:19,221 INFO L93 Difference]: Finished difference Result 12467 states and 34706 transitions. [2019-12-18 14:36:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 14:36:19,221 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-18 14:36:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:19,235 INFO L225 Difference]: With dead ends: 12467 [2019-12-18 14:36:19,236 INFO L226 Difference]: Without dead ends: 12442 [2019-12-18 14:36:19,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=499, Invalid=2923, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 14:36:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12442 states. [2019-12-18 14:36:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12442 to 4517. [2019-12-18 14:36:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-12-18 14:36:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 12672 transitions. [2019-12-18 14:36:19,330 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 12672 transitions. Word has length 68 [2019-12-18 14:36:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:19,330 INFO L462 AbstractCegarLoop]: Abstraction has 4517 states and 12672 transitions. [2019-12-18 14:36:19,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:36:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 12672 transitions. [2019-12-18 14:36:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:19,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:19,334 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-18 14:36:19,334 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:19,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:19,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1425961288, now seen corresponding path program 10 times [2019-12-18 14:36:19,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:19,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73403254] [2019-12-18 14:36:19,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:19,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73403254] [2019-12-18 14:36:19,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:19,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:36:19,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935257252] [2019-12-18 14:36:19,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:36:19,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:36:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:36:19,697 INFO L87 Difference]: Start difference. First operand 4517 states and 12672 transitions. Second operand 16 states. [2019-12-18 14:36:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:20,741 INFO L93 Difference]: Finished difference Result 6473 states and 17960 transitions. [2019-12-18 14:36:20,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:36:20,742 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-18 14:36:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:20,751 INFO L225 Difference]: With dead ends: 6473 [2019-12-18 14:36:20,751 INFO L226 Difference]: Without dead ends: 6448 [2019-12-18 14:36:20,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 14:36:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6448 states. [2019-12-18 14:36:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6448 to 4062. [2019-12-18 14:36:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-18 14:36:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-18 14:36:20,817 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-18 14:36:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:20,817 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-18 14:36:20,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:36:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-18 14:36:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:20,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:20,821 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-18 14:36:20,822 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 11 times [2019-12-18 14:36:20,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:20,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754608996] [2019-12-18 14:36:20,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:36:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:36:20,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:36:20,932 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:36:20,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1976~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1976~0.base_23|) |v_ULTIMATE.start_main_~#t1976~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1976~0.base_23|)) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= 0 |v_ULTIMATE.start_main_~#t1976~0.offset_17|) (= v_~z$w_buff1_used~0_381 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1976~0.base_23| 4)) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_41) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1976~0.base_23| 1)) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= v_~z$r_buff0_thd2~0_100 0) (= v_~z$r_buff1_thd2~0_185 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1976~0.base_23|) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ULTIMATE.start_main_~#t1977~0.offset=|v_ULTIMATE.start_main_~#t1977~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_~#t1976~0.base=|v_ULTIMATE.start_main_~#t1976~0.base_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1976~0.offset=|v_ULTIMATE.start_main_~#t1976~0.offset_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~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_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ULTIMATE.start_main_~#t1977~0.base=|v_ULTIMATE.start_main_~#t1977~0.base_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~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_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1978~0.offset=|v_ULTIMATE.start_main_~#t1978~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194, ULTIMATE.start_main_~#t1978~0.base=|v_ULTIMATE.start_main_~#t1978~0.base_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1977~0.offset, ~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_#t~ite43, 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_~#t1976~0.base, 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, ULTIMATE.start_main_~#t1976~0.offset, ~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, ULTIMATE.start_main_~#t1977~0.base, ~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_~#t1978~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, 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, ULTIMATE.start_main_~#t1978~0.base] because there is no mapped edge [2019-12-18 14:36:20,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1977~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1977~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1977~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1977~0.base_11|) |v_ULTIMATE.start_main_~#t1977~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1977~0.offset_10| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1977~0.base_11|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1977~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1977~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1977~0.base=|v_ULTIMATE.start_main_~#t1977~0.base_11|, ULTIMATE.start_main_~#t1977~0.offset=|v_ULTIMATE.start_main_~#t1977~0.offset_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1977~0.base, ULTIMATE.start_main_~#t1977~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 14:36:20,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} 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-18 14:36:20,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1978~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1978~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1978~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1978~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1978~0.base_12|) |v_ULTIMATE.start_main_~#t1978~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1978~0.base_12| 1)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1978~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t1978~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1978~0.offset=|v_ULTIMATE.start_main_~#t1978~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_~#t1978~0.base=|v_ULTIMATE.start_main_~#t1978~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1978~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1978~0.base] because there is no mapped edge [2019-12-18 14:36:20,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1459689881 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1459689881 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1459689881| ~z$w_buff0_used~0_In1459689881)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1459689881|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1459689881, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1459689881} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1459689881|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1459689881, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1459689881} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:36:20,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1519926139 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1519926139 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1519926139 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1519926139 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1519926139| ~z$w_buff1_used~0_In-1519926139) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1519926139| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1519926139, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1519926139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1519926139, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1519926139} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1519926139|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1519926139, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1519926139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1519926139, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1519926139} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:36:20,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1345816827 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1345816827 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1345816827 ~z$r_buff0_thd1~0_In1345816827)) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out1345816827 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1345816827, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1345816827} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1345816827, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1345816827|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1345816827} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:36:20,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-994473895 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-994473895 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-994473895 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-994473895 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-994473895 |P0Thread1of1ForFork0_#t~ite8_Out-994473895|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-994473895| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-994473895, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-994473895, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-994473895, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-994473895} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-994473895, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-994473895|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-994473895, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-994473895, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-994473895} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:36:20,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} 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-18 14:36:20,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1952967033 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1952967033 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1952967033| ~z~0_In-1952967033) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1952967033| ~z$w_buff1~0_In-1952967033) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1952967033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952967033, ~z$w_buff1~0=~z$w_buff1~0_In-1952967033, ~z~0=~z~0_In-1952967033} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1952967033|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1952967033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952967033, ~z$w_buff1~0=~z$w_buff1~0_In-1952967033, ~z~0=~z~0_In-1952967033} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 14:36:20,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 14:36:20,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-682905558 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-682905558 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-682905558|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-682905558 |P1Thread1of1ForFork1_#t~ite11_Out-682905558|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-682905558, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-682905558} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-682905558, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-682905558|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-682905558} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:36:20,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2096967958 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2096967958 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-2096967958 |P2Thread1of1ForFork2_#t~ite15_Out-2096967958|) (not .cse1)) (and (= ~z~0_In-2096967958 |P2Thread1of1ForFork2_#t~ite15_Out-2096967958|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2096967958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2096967958, ~z$w_buff1~0=~z$w_buff1~0_In-2096967958, ~z~0=~z~0_In-2096967958} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-2096967958|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2096967958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2096967958, ~z$w_buff1~0=~z$w_buff1~0_In-2096967958, ~z~0=~z~0_In-2096967958} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:36:20,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In398234109 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In398234109 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In398234109 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In398234109 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out398234109|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In398234109 |P1Thread1of1ForFork1_#t~ite12_Out398234109|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In398234109, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In398234109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In398234109, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In398234109} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In398234109, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In398234109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In398234109, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out398234109|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In398234109} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:36:20,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In40111264 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In40111264 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out40111264| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out40111264| ~z$r_buff0_thd2~0_In40111264) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In40111264, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In40111264} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In40111264, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out40111264|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In40111264} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:36:20,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 14:36:20,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In103141131 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In103141131 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out103141131|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In103141131 |P2Thread1of1ForFork2_#t~ite17_Out103141131|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In103141131, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In103141131} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In103141131, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In103141131, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out103141131|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:36:20,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1470065648 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1470065648 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1470065648 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1470065648 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1470065648|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1470065648 |P2Thread1of1ForFork2_#t~ite18_Out-1470065648|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1470065648, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1470065648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1470065648, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1470065648} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1470065648, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1470065648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1470065648, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1470065648, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1470065648|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:36:20,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In443664262 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In443664262 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out443664262| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out443664262| ~z$r_buff0_thd3~0_In443664262) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In443664262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In443664262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In443664262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In443664262, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out443664262|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:36:20,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In101880710 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In101880710 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In101880710 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In101880710 256)))) (or (and (= ~z$r_buff1_thd3~0_In101880710 |P2Thread1of1ForFork2_#t~ite20_Out101880710|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out101880710|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In101880710, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In101880710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101880710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In101880710} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In101880710, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out101880710|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In101880710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101880710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In101880710} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:36:20,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, 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-18 14:36:20,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-577524003 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-577524003 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-577524003 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-577524003 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-577524003| ~z$r_buff1_thd2~0_In-577524003) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-577524003| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-577524003, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-577524003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-577524003, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-577524003} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-577524003, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-577524003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-577524003, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-577524003|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-577524003} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:36:20,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, 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-18 14:36:20,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:36:20,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In730845378 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In730845378 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In730845378 |ULTIMATE.start_main_#t~ite24_Out730845378|)) (and (= ~z$w_buff1~0_In730845378 |ULTIMATE.start_main_#t~ite24_Out730845378|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In730845378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In730845378, ~z$w_buff1~0=~z$w_buff1~0_In730845378, ~z~0=~z~0_In730845378} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In730845378, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out730845378|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In730845378, ~z$w_buff1~0=~z$w_buff1~0_In730845378, ~z~0=~z~0_In730845378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 14:36:20,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-18 14:36:20,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1050730818 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1050730818 256)))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out1050730818| ~z$w_buff0_used~0_In1050730818) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1050730818|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050730818, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050730818} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050730818, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050730818, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1050730818|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:36:20,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1720523751 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1720523751 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1720523751 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1720523751 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1720523751|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1720523751 |ULTIMATE.start_main_#t~ite27_Out-1720523751|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1720523751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1720523751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1720523751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1720523751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1720523751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1720523751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1720523751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1720523751, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1720523751|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:36:20,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1734327792 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1734327792 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-1734327792|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1734327792 |ULTIMATE.start_main_#t~ite28_Out-1734327792|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1734327792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1734327792} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1734327792, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1734327792|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1734327792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:36:20,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In850037316 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In850037316 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In850037316 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In850037316 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out850037316| 0)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In850037316 |ULTIMATE.start_main_#t~ite29_Out850037316|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In850037316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In850037316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In850037316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In850037316} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In850037316, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out850037316|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In850037316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In850037316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In850037316} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:36:20,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} 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-18 14:36:20,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, 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-18 14:36:20,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] 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-18 14:36:21,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:36:21 BasicIcfg [2019-12-18 14:36:21,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:36:21,040 INFO L168 Benchmark]: Toolchain (without parser) took 121615.63 ms. Allocated memory was 141.6 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 105.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 819.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:21,040 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 141.6 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:36:21,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.77 ms. Allocated memory was 141.6 MB in the beginning and 206.0 MB in the end (delta: 64.5 MB). Free memory was 104.9 MB in the beginning and 158.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:21,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.82 ms. Allocated memory is still 206.0 MB. Free memory was 158.1 MB in the beginning and 154.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:21,042 INFO L168 Benchmark]: Boogie Preprocessor took 48.44 ms. Allocated memory is still 206.0 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:21,042 INFO L168 Benchmark]: RCFGBuilder took 839.69 ms. Allocated memory is still 206.0 MB. Free memory was 152.3 MB in the beginning and 102.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:21,043 INFO L168 Benchmark]: TraceAbstraction took 119817.60 ms. Allocated memory was 206.0 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 102.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 752.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:21,046 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 141.6 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.77 ms. Allocated memory was 141.6 MB in the beginning and 206.0 MB in the end (delta: 64.5 MB). Free memory was 104.9 MB in the beginning and 158.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.82 ms. Allocated memory is still 206.0 MB. Free memory was 158.1 MB in the beginning and 154.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.44 ms. Allocated memory is still 206.0 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.69 ms. Allocated memory is still 206.0 MB. Free memory was 152.3 MB in the beginning and 102.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119817.60 ms. Allocated memory was 206.0 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 102.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 752.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 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(&t1976, ((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(&t1977, ((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(&t1978, ((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: 119.5s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 44.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3870 SDtfs, 6778 SDslu, 19547 SDs, 0 SdLazy, 20898 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 40 SyntacticMatches, 25 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5828 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred 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: 44.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 128399 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1265 NumberOfCodeBlocks, 1265 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1174 ConstructedInterpolants, 0 QuantifiedInterpolants, 484424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...