/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:01:18,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:01:18,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:01:18,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:01:18,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:01:18,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:01:18,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:01:18,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:01:18,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:01:18,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:01:18,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:01:18,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:01:18,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:01:18,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:01:18,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:01:18,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:01:18,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:01:18,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:01:18,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:01:18,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:01:18,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:01:18,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:01:18,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:01:18,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:01:18,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:01:18,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:01:18,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:01:18,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:01:18,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:01:18,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:01:18,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:01:18,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:01:18,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:01:18,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:01:18,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:01:18,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:01:18,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:01:18,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:01:18,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:01:18,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:01:18,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:01:18,210 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 04:01:18,237 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:01:18,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:01:18,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:01:18,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:01:18,239 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:01:18,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:01:18,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:01:18,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:01:18,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:01:18,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:01:18,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:01:18,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:01:18,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:01:18,241 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:01:18,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:01:18,241 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:01:18,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:01:18,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:01:18,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:01:18,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:01:18,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:01:18,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:01:18,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:01:18,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:01:18,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:01:18,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:01:18,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:01:18,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:01:18,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:01:18,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:01:18,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:01:18,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:01:18,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:01:18,549 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:01:18,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i [2019-12-27 04:01:18,622 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618719d03/ddb662642ddf4209b7c88fbc68485525/FLAG73c9318be [2019-12-27 04:01:19,164 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:01:19,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i [2019-12-27 04:01:19,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618719d03/ddb662642ddf4209b7c88fbc68485525/FLAG73c9318be [2019-12-27 04:01:19,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618719d03/ddb662642ddf4209b7c88fbc68485525 [2019-12-27 04:01:19,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:01:19,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:01:19,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:01:19,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:01:19,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:01:19,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:19" (1/1) ... [2019-12-27 04:01:19,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fc715b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:19, skipping insertion in model container [2019-12-27 04:01:19,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:19" (1/1) ... [2019-12-27 04:01:19,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:01:19,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:01:20,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:01:20,062 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:01:20,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:01:20,216 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:01:20,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20 WrapperNode [2019-12-27 04:01:20,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:01:20,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:01:20,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:01:20,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:01:20,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:01:20,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:01:20,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:01:20,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:01:20,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (1/1) ... [2019-12-27 04:01:20,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:01:20,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:01:20,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:01:20,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:01:20,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01: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-27 04:01:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:01:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:01:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:01:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:01:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:01:20,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:01:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:01:20,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:01:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 04:01:20,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 04:01:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:01:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:01:20,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:01:20,412 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:01:21,208 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:01:21,208 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:01:21,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:21 BoogieIcfgContainer [2019-12-27 04:01:21,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:01:21,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:01:21,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:01:21,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:01:21,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:01:19" (1/3) ... [2019-12-27 04:01:21,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41353d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:21, skipping insertion in model container [2019-12-27 04:01:21,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:20" (2/3) ... [2019-12-27 04:01:21,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41353d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:21, skipping insertion in model container [2019-12-27 04:01:21,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:21" (3/3) ... [2019-12-27 04:01:21,224 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.opt.i [2019-12-27 04:01:21,234 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:01:21,235 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:01:21,249 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:01:21,250 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:01:21,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,313 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,331 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,331 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,381 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,381 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,390 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:21,410 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:01:21,430 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:01:21,430 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:01:21,430 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:01:21,430 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:01:21,430 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:01:21,430 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:01:21,431 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:01:21,431 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:01:21,446 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 04:01:21,448 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 04:01:21,554 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 04:01:21,555 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:01:21,571 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 04:01:21,596 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 04:01:21,651 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 04:01:21,651 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:01:21,660 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 04:01:21,682 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 04:01:21,684 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:01:26,671 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 04:01:27,032 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 04:01:27,162 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 04:01:27,193 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-27 04:01:27,193 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 04:01:27,197 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-27 04:01:43,856 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-27 04:01:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-27 04:01:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:01:43,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:01:43,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:01:43,864 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:01:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:01:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-27 04:01:43,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:01:43,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119332302] [2019-12-27 04:01:43,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:01:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:01:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:01:44,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119332302] [2019-12-27 04:01:44,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:01:44,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:01:44,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157999391] [2019-12-27 04:01:44,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:01:44,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:01:44,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:01:44,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:01:44,146 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-27 04:01:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:01:47,545 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-27 04:01:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:01:47,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:01:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:01:48,140 INFO L225 Difference]: With dead ends: 108680 [2019-12-27 04:01:48,140 INFO L226 Difference]: Without dead ends: 102440 [2019-12-27 04:01:48,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:01:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-27 04:01:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-27 04:01:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-27 04:01:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-27 04:01:58,705 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-27 04:01:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:01:58,706 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-27 04:01:58,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:01:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-27 04:01:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:01:58,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:01:58,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:01:58,711 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:01:58,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:01:58,711 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-27 04:01:58,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:01:58,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473955874] [2019-12-27 04:01:58,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:01:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:01:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:01:58,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473955874] [2019-12-27 04:01:58,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:01:58,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:01:58,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359732607] [2019-12-27 04:01:58,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:01:58,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:01:58,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:01:58,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:01:58,860 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-27 04:02:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:04,019 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-27 04:02:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:02:04,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 04:02:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:04,729 INFO L225 Difference]: With dead ends: 163248 [2019-12-27 04:02:04,729 INFO L226 Difference]: Without dead ends: 163199 [2019-12-27 04:02:04,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:02:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-27 04:02:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-27 04:02:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-27 04:02:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-27 04:02:13,843 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-27 04:02:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:13,843 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-27 04:02:13,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:02:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-27 04:02:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:02:13,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:13,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:13,850 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-27 04:02:13,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:13,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779790370] [2019-12-27 04:02:13,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:13,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779790370] [2019-12-27 04:02:13,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:13,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:02:13,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486078831] [2019-12-27 04:02:13,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:02:13,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:02:13,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:02:13,955 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-27 04:02:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:14,219 INFO L93 Difference]: Finished difference Result 43706 states and 149507 transitions. [2019-12-27 04:02:14,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:02:14,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 04:02:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:14,284 INFO L225 Difference]: With dead ends: 43706 [2019-12-27 04:02:14,285 INFO L226 Difference]: Without dead ends: 33577 [2019-12-27 04:02:14,285 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-27 04:02:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33577 states. [2019-12-27 04:02:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33577 to 33481. [2019-12-27 04:02:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33481 states. [2019-12-27 04:02:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33481 states to 33481 states and 108822 transitions. [2019-12-27 04:02:19,859 INFO L78 Accepts]: Start accepts. Automaton has 33481 states and 108822 transitions. Word has length 13 [2019-12-27 04:02:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:19,861 INFO L462 AbstractCegarLoop]: Abstraction has 33481 states and 108822 transitions. [2019-12-27 04:02:19,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:02:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 33481 states and 108822 transitions. [2019-12-27 04:02:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:02:19,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:19,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:19,865 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-27 04:02:19,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:19,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601681673] [2019-12-27 04:02:19,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:20,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601681673] [2019-12-27 04:02:20,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:20,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:02:20,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679179983] [2019-12-27 04:02:20,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:02:20,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:20,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:02:20,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:02:20,024 INFO L87 Difference]: Start difference. First operand 33481 states and 108822 transitions. Second operand 5 states. [2019-12-27 04:02:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:20,512 INFO L93 Difference]: Finished difference Result 45175 states and 144711 transitions. [2019-12-27 04:02:20,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:02:20,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 04:02:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:20,585 INFO L225 Difference]: With dead ends: 45175 [2019-12-27 04:02:20,585 INFO L226 Difference]: Without dead ends: 45175 [2019-12-27 04:02:20,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:02:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45175 states. [2019-12-27 04:02:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45175 to 38347. [2019-12-27 04:02:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38347 states. [2019-12-27 04:02:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38347 states to 38347 states and 123865 transitions. [2019-12-27 04:02:21,612 INFO L78 Accepts]: Start accepts. Automaton has 38347 states and 123865 transitions. Word has length 16 [2019-12-27 04:02:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:21,612 INFO L462 AbstractCegarLoop]: Abstraction has 38347 states and 123865 transitions. [2019-12-27 04:02:21,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:02:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 38347 states and 123865 transitions. [2019-12-27 04:02:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:02:21,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:21,622 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] [2019-12-27 04:02:21,622 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:21,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:21,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-27 04:02:21,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:21,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253307608] [2019-12-27 04:02:21,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:21,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253307608] [2019-12-27 04:02:21,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:21,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:02:21,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526512875] [2019-12-27 04:02:21,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:02:21,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:21,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:02:21,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:02:21,739 INFO L87 Difference]: Start difference. First operand 38347 states and 123865 transitions. Second operand 6 states. [2019-12-27 04:02:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:22,725 INFO L93 Difference]: Finished difference Result 58112 states and 182585 transitions. [2019-12-27 04:02:22,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:02:22,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 04:02:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:22,821 INFO L225 Difference]: With dead ends: 58112 [2019-12-27 04:02:22,821 INFO L226 Difference]: Without dead ends: 58056 [2019-12-27 04:02:22,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:02:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2019-12-27 04:02:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 38947. [2019-12-27 04:02:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38947 states. [2019-12-27 04:02:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38947 states to 38947 states and 124912 transitions. [2019-12-27 04:02:24,020 INFO L78 Accepts]: Start accepts. Automaton has 38947 states and 124912 transitions. Word has length 22 [2019-12-27 04:02:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:24,021 INFO L462 AbstractCegarLoop]: Abstraction has 38947 states and 124912 transitions. [2019-12-27 04:02:24,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:02:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 38947 states and 124912 transitions. [2019-12-27 04:02:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:02:24,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:24,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:24,035 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:24,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-27 04:02:24,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:24,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835811414] [2019-12-27 04:02:24,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:24,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835811414] [2019-12-27 04:02:24,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:24,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:02:24,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617452488] [2019-12-27 04:02:24,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:02:24,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:02:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:02:24,129 INFO L87 Difference]: Start difference. First operand 38947 states and 124912 transitions. Second operand 5 states. [2019-12-27 04:02:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:24,228 INFO L93 Difference]: Finished difference Result 17807 states and 53973 transitions. [2019-12-27 04:02:24,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:02:24,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 04:02:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:24,251 INFO L225 Difference]: With dead ends: 17807 [2019-12-27 04:02:24,251 INFO L226 Difference]: Without dead ends: 15537 [2019-12-27 04:02:24,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:02:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15537 states. [2019-12-27 04:02:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15537 to 15208. [2019-12-27 04:02:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-27 04:02:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 46078 transitions. [2019-12-27 04:02:24,483 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 46078 transitions. Word has length 25 [2019-12-27 04:02:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:24,483 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 46078 transitions. [2019-12-27 04:02:24,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:02:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 46078 transitions. [2019-12-27 04:02:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:02:24,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:24,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:24,494 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:24,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-27 04:02:24,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:24,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942798392] [2019-12-27 04:02:24,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:24,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942798392] [2019-12-27 04:02:24,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:24,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:02:24,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103540925] [2019-12-27 04:02:24,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:02:24,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:02:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:02:24,603 INFO L87 Difference]: Start difference. First operand 15208 states and 46078 transitions. Second operand 6 states. [2019-12-27 04:02:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:25,257 INFO L93 Difference]: Finished difference Result 21807 states and 64079 transitions. [2019-12-27 04:02:25,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:02:25,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 04:02:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:25,290 INFO L225 Difference]: With dead ends: 21807 [2019-12-27 04:02:25,290 INFO L226 Difference]: Without dead ends: 21497 [2019-12-27 04:02:25,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:02:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21497 states. [2019-12-27 04:02:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21497 to 17340. [2019-12-27 04:02:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17340 states. [2019-12-27 04:02:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 51993 transitions. [2019-12-27 04:02:25,571 INFO L78 Accepts]: Start accepts. Automaton has 17340 states and 51993 transitions. Word has length 27 [2019-12-27 04:02:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:25,571 INFO L462 AbstractCegarLoop]: Abstraction has 17340 states and 51993 transitions. [2019-12-27 04:02:25,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:02:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17340 states and 51993 transitions. [2019-12-27 04:02:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 04:02:25,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:25,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:25,588 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-27 04:02:25,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:25,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383719918] [2019-12-27 04:02:25,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:25,965 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-12-27 04:02:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:26,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383719918] [2019-12-27 04:02:26,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:26,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:02:26,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792232992] [2019-12-27 04:02:26,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:02:26,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:26,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:02:26,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:02:26,146 INFO L87 Difference]: Start difference. First operand 17340 states and 51993 transitions. Second operand 9 states. [2019-12-27 04:02:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:27,988 INFO L93 Difference]: Finished difference Result 26921 states and 78942 transitions. [2019-12-27 04:02:27,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 04:02:27,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 04:02:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:28,026 INFO L225 Difference]: With dead ends: 26921 [2019-12-27 04:02:28,026 INFO L226 Difference]: Without dead ends: 26750 [2019-12-27 04:02:28,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:02:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26750 states. [2019-12-27 04:02:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26750 to 18050. [2019-12-27 04:02:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-27 04:02:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 54086 transitions. [2019-12-27 04:02:28,333 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 54086 transitions. Word has length 33 [2019-12-27 04:02:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:28,334 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 54086 transitions. [2019-12-27 04:02:28,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:02:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 54086 transitions. [2019-12-27 04:02:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 04:02:28,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:28,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:28,354 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:28,355 INFO L82 PathProgramCache]: Analyzing trace with hash -880254701, now seen corresponding path program 1 times [2019-12-27 04:02:28,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:28,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472201030] [2019-12-27 04:02:28,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:28,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472201030] [2019-12-27 04:02:28,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:28,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:02:28,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771831372] [2019-12-27 04:02:28,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:02:28,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:02:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:02:28,473 INFO L87 Difference]: Start difference. First operand 18050 states and 54086 transitions. Second operand 7 states. [2019-12-27 04:02:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:29,603 INFO L93 Difference]: Finished difference Result 24862 states and 72689 transitions. [2019-12-27 04:02:29,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:02:29,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 04:02:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:29,641 INFO L225 Difference]: With dead ends: 24862 [2019-12-27 04:02:29,641 INFO L226 Difference]: Without dead ends: 24325 [2019-12-27 04:02:29,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:02:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24325 states. [2019-12-27 04:02:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24325 to 16133. [2019-12-27 04:02:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16133 states. [2019-12-27 04:02:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 48292 transitions. [2019-12-27 04:02:30,238 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 48292 transitions. Word has length 37 [2019-12-27 04:02:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:30,238 INFO L462 AbstractCegarLoop]: Abstraction has 16133 states and 48292 transitions. [2019-12-27 04:02:30,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:02:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 48292 transitions. [2019-12-27 04:02:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 04:02:30,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:30,256 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] [2019-12-27 04:02:30,256 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:30,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:30,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2090975987, now seen corresponding path program 1 times [2019-12-27 04:02:30,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:30,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616786884] [2019-12-27 04:02:30,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:30,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616786884] [2019-12-27 04:02:30,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:30,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:02:30,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125527923] [2019-12-27 04:02:30,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:02:30,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:02:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:30,322 INFO L87 Difference]: Start difference. First operand 16133 states and 48292 transitions. Second operand 3 states. [2019-12-27 04:02:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:30,383 INFO L93 Difference]: Finished difference Result 16132 states and 48290 transitions. [2019-12-27 04:02:30,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:02:30,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 04:02:30,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:30,414 INFO L225 Difference]: With dead ends: 16132 [2019-12-27 04:02:30,415 INFO L226 Difference]: Without dead ends: 16132 [2019-12-27 04:02:30,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16132 states. [2019-12-27 04:02:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16132 to 16132. [2019-12-27 04:02:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-12-27 04:02:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 48290 transitions. [2019-12-27 04:02:30,782 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 48290 transitions. Word has length 39 [2019-12-27 04:02:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:30,783 INFO L462 AbstractCegarLoop]: Abstraction has 16132 states and 48290 transitions. [2019-12-27 04:02:30,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:02:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 48290 transitions. [2019-12-27 04:02:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 04:02:30,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:30,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:30,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1209723158, now seen corresponding path program 1 times [2019-12-27 04:02:30,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:30,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447178373] [2019-12-27 04:02:30,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:30,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447178373] [2019-12-27 04:02:30,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:30,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:02:30,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57640648] [2019-12-27 04:02:30,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:02:30,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:02:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:02:30,939 INFO L87 Difference]: Start difference. First operand 16132 states and 48290 transitions. Second operand 5 states. [2019-12-27 04:02:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:31,558 INFO L93 Difference]: Finished difference Result 23123 states and 68815 transitions. [2019-12-27 04:02:31,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:02:31,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 04:02:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:31,595 INFO L225 Difference]: With dead ends: 23123 [2019-12-27 04:02:31,596 INFO L226 Difference]: Without dead ends: 23123 [2019-12-27 04:02:31,596 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-27 04:02:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23123 states. [2019-12-27 04:02:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23123 to 21513. [2019-12-27 04:02:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21513 states. [2019-12-27 04:02:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21513 states to 21513 states and 64419 transitions. [2019-12-27 04:02:31,936 INFO L78 Accepts]: Start accepts. Automaton has 21513 states and 64419 transitions. Word has length 40 [2019-12-27 04:02:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:31,936 INFO L462 AbstractCegarLoop]: Abstraction has 21513 states and 64419 transitions. [2019-12-27 04:02:31,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:02:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 21513 states and 64419 transitions. [2019-12-27 04:02:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 04:02:31,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:31,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:31,959 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -739159160, now seen corresponding path program 2 times [2019-12-27 04:02:31,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:31,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184605680] [2019-12-27 04:02:31,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:32,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184605680] [2019-12-27 04:02:32,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:32,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:02:32,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948095770] [2019-12-27 04:02:32,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:02:32,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:02:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:32,043 INFO L87 Difference]: Start difference. First operand 21513 states and 64419 transitions. Second operand 3 states. [2019-12-27 04:02:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:32,149 INFO L93 Difference]: Finished difference Result 21513 states and 63776 transitions. [2019-12-27 04:02:32,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:02:32,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 04:02:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:32,195 INFO L225 Difference]: With dead ends: 21513 [2019-12-27 04:02:32,195 INFO L226 Difference]: Without dead ends: 21513 [2019-12-27 04:02:32,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21513 states. [2019-12-27 04:02:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21513 to 21421. [2019-12-27 04:02:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21421 states. [2019-12-27 04:02:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21421 states to 21421 states and 63522 transitions. [2019-12-27 04:02:33,009 INFO L78 Accepts]: Start accepts. Automaton has 21421 states and 63522 transitions. Word has length 40 [2019-12-27 04:02:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:33,009 INFO L462 AbstractCegarLoop]: Abstraction has 21421 states and 63522 transitions. [2019-12-27 04:02:33,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:02:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 21421 states and 63522 transitions. [2019-12-27 04:02:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:02:33,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:33,041 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] [2019-12-27 04:02:33,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1835008453, now seen corresponding path program 1 times [2019-12-27 04:02:33,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:33,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291834946] [2019-12-27 04:02:33,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:33,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291834946] [2019-12-27 04:02:33,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:33,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:02:33,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868470731] [2019-12-27 04:02:33,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:02:33,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:02:33,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:33,152 INFO L87 Difference]: Start difference. First operand 21421 states and 63522 transitions. Second operand 3 states. [2019-12-27 04:02:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:33,252 INFO L93 Difference]: Finished difference Result 21346 states and 63289 transitions. [2019-12-27 04:02:33,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:02:33,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 04:02:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:33,302 INFO L225 Difference]: With dead ends: 21346 [2019-12-27 04:02:33,302 INFO L226 Difference]: Without dead ends: 21346 [2019-12-27 04:02:33,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2019-12-27 04:02:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 17850. [2019-12-27 04:02:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17850 states. [2019-12-27 04:02:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17850 states to 17850 states and 53557 transitions. [2019-12-27 04:02:33,780 INFO L78 Accepts]: Start accepts. Automaton has 17850 states and 53557 transitions. Word has length 41 [2019-12-27 04:02:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:33,781 INFO L462 AbstractCegarLoop]: Abstraction has 17850 states and 53557 transitions. [2019-12-27 04:02:33,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:02:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 17850 states and 53557 transitions. [2019-12-27 04:02:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 04:02:33,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:33,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:33,806 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:33,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1386848900, now seen corresponding path program 1 times [2019-12-27 04:02:33,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:33,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369248745] [2019-12-27 04:02:33,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:33,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369248745] [2019-12-27 04:02:33,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:33,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:02:33,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635646913] [2019-12-27 04:02:33,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:02:33,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:33,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:02:33,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:02:33,888 INFO L87 Difference]: Start difference. First operand 17850 states and 53557 transitions. Second operand 6 states. [2019-12-27 04:02:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:34,017 INFO L93 Difference]: Finished difference Result 16802 states and 51226 transitions. [2019-12-27 04:02:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:02:34,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 04:02:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:34,046 INFO L225 Difference]: With dead ends: 16802 [2019-12-27 04:02:34,046 INFO L226 Difference]: Without dead ends: 16672 [2019-12-27 04:02:34,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:02:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-27 04:02:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-27 04:02:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-27 04:02:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 50949 transitions. [2019-12-27 04:02:34,305 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 50949 transitions. Word has length 42 [2019-12-27 04:02:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:34,305 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 50949 transitions. [2019-12-27 04:02:34,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:02:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 50949 transitions. [2019-12-27 04:02:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:02:34,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:34,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:34,330 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-27 04:02:34,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:34,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439855102] [2019-12-27 04:02:34,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:34,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439855102] [2019-12-27 04:02:34,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:34,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:02:34,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705387700] [2019-12-27 04:02:34,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:02:34,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:34,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:02:34,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:34,370 INFO L87 Difference]: Start difference. First operand 16672 states and 50949 transitions. Second operand 3 states. [2019-12-27 04:02:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:34,493 INFO L93 Difference]: Finished difference Result 23766 states and 72975 transitions. [2019-12-27 04:02:34,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:02:34,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:02:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:34,535 INFO L225 Difference]: With dead ends: 23766 [2019-12-27 04:02:34,535 INFO L226 Difference]: Without dead ends: 23766 [2019-12-27 04:02:34,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23766 states. [2019-12-27 04:02:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23766 to 18908. [2019-12-27 04:02:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18908 states. [2019-12-27 04:02:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18908 states to 18908 states and 58542 transitions. [2019-12-27 04:02:34,867 INFO L78 Accepts]: Start accepts. Automaton has 18908 states and 58542 transitions. Word has length 66 [2019-12-27 04:02:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:34,867 INFO L462 AbstractCegarLoop]: Abstraction has 18908 states and 58542 transitions. [2019-12-27 04:02:34,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:02:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 18908 states and 58542 transitions. [2019-12-27 04:02:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:02:34,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:34,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:34,887 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-27 04:02:34,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:34,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226434635] [2019-12-27 04:02:34,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:34,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226434635] [2019-12-27 04:02:34,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:34,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:02:34,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508176039] [2019-12-27 04:02:34,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:02:34,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:34,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:02:34,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:34,931 INFO L87 Difference]: Start difference. First operand 18908 states and 58542 transitions. Second operand 3 states. [2019-12-27 04:02:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:35,307 INFO L93 Difference]: Finished difference Result 22628 states and 67954 transitions. [2019-12-27 04:02:35,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:02:35,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:02:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:35,345 INFO L225 Difference]: With dead ends: 22628 [2019-12-27 04:02:35,345 INFO L226 Difference]: Without dead ends: 22628 [2019-12-27 04:02:35,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22628 states. [2019-12-27 04:02:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22628 to 17579. [2019-12-27 04:02:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-12-27 04:02:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 52993 transitions. [2019-12-27 04:02:35,660 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 52993 transitions. Word has length 66 [2019-12-27 04:02:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:35,660 INFO L462 AbstractCegarLoop]: Abstraction has 17579 states and 52993 transitions. [2019-12-27 04:02:35,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:02:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 52993 transitions. [2019-12-27 04:02:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:02:35,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:35,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:35,677 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-27 04:02:35,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:35,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92024635] [2019-12-27 04:02:35,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:35,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92024635] [2019-12-27 04:02:35,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:35,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:02:35,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133616892] [2019-12-27 04:02:35,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:02:35,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:35,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:02:35,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:02:35,779 INFO L87 Difference]: Start difference. First operand 17579 states and 52993 transitions. Second operand 7 states. [2019-12-27 04:02:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:36,350 INFO L93 Difference]: Finished difference Result 51897 states and 154354 transitions. [2019-12-27 04:02:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:02:36,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 04:02:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:36,399 INFO L225 Difference]: With dead ends: 51897 [2019-12-27 04:02:36,399 INFO L226 Difference]: Without dead ends: 37071 [2019-12-27 04:02:36,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:02:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37071 states. [2019-12-27 04:02:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37071 to 21234. [2019-12-27 04:02:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21234 states. [2019-12-27 04:02:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21234 states to 21234 states and 63310 transitions. [2019-12-27 04:02:36,851 INFO L78 Accepts]: Start accepts. Automaton has 21234 states and 63310 transitions. Word has length 66 [2019-12-27 04:02:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:36,852 INFO L462 AbstractCegarLoop]: Abstraction has 21234 states and 63310 transitions. [2019-12-27 04:02:36,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:02:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 21234 states and 63310 transitions. [2019-12-27 04:02:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:02:36,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:36,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:36,875 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:36,875 INFO L82 PathProgramCache]: Analyzing trace with hash 659069437, now seen corresponding path program 2 times [2019-12-27 04:02:36,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:36,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319649658] [2019-12-27 04:02:36,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:36,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319649658] [2019-12-27 04:02:36,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:36,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:02:36,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133399595] [2019-12-27 04:02:36,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:02:36,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:02:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:02:36,985 INFO L87 Difference]: Start difference. First operand 21234 states and 63310 transitions. Second operand 8 states. [2019-12-27 04:02:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:39,823 INFO L93 Difference]: Finished difference Result 32742 states and 95766 transitions. [2019-12-27 04:02:39,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:02:39,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 04:02:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:39,878 INFO L225 Difference]: With dead ends: 32742 [2019-12-27 04:02:39,878 INFO L226 Difference]: Without dead ends: 32470 [2019-12-27 04:02:39,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:02:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32470 states. [2019-12-27 04:02:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32470 to 20332. [2019-12-27 04:02:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20332 states. [2019-12-27 04:02:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20332 states to 20332 states and 60813 transitions. [2019-12-27 04:02:40,270 INFO L78 Accepts]: Start accepts. Automaton has 20332 states and 60813 transitions. Word has length 66 [2019-12-27 04:02:40,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:40,270 INFO L462 AbstractCegarLoop]: Abstraction has 20332 states and 60813 transitions. [2019-12-27 04:02:40,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:02:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 20332 states and 60813 transitions. [2019-12-27 04:02:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:02:40,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:40,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:40,292 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:40,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:40,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1259142147, now seen corresponding path program 3 times [2019-12-27 04:02:40,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:40,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236066665] [2019-12-27 04:02:40,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:40,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236066665] [2019-12-27 04:02:40,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:40,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:02:40,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875839413] [2019-12-27 04:02:40,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:02:40,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:02:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:02:40,639 INFO L87 Difference]: Start difference. First operand 20332 states and 60813 transitions. Second operand 11 states. [2019-12-27 04:02:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:42,204 INFO L93 Difference]: Finished difference Result 47294 states and 141397 transitions. [2019-12-27 04:02:42,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 04:02:42,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 04:02:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:42,264 INFO L225 Difference]: With dead ends: 47294 [2019-12-27 04:02:42,264 INFO L226 Difference]: Without dead ends: 44727 [2019-12-27 04:02:42,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:02:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44727 states. [2019-12-27 04:02:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44727 to 25356. [2019-12-27 04:02:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25356 states. [2019-12-27 04:02:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25356 states to 25356 states and 75461 transitions. [2019-12-27 04:02:42,795 INFO L78 Accepts]: Start accepts. Automaton has 25356 states and 75461 transitions. Word has length 66 [2019-12-27 04:02:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:42,796 INFO L462 AbstractCegarLoop]: Abstraction has 25356 states and 75461 transitions. [2019-12-27 04:02:42,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:02:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 25356 states and 75461 transitions. [2019-12-27 04:02:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:02:43,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:43,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:43,130 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash -94146317, now seen corresponding path program 4 times [2019-12-27 04:02:43,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:43,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134269731] [2019-12-27 04:02:43,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:43,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134269731] [2019-12-27 04:02:43,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:43,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:02:43,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704806196] [2019-12-27 04:02:43,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:02:43,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:43,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:02:43,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:02:43,431 INFO L87 Difference]: Start difference. First operand 25356 states and 75461 transitions. Second operand 11 states. [2019-12-27 04:02:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:44,571 INFO L93 Difference]: Finished difference Result 45477 states and 134416 transitions. [2019-12-27 04:02:44,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:02:44,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 04:02:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:44,623 INFO L225 Difference]: With dead ends: 45477 [2019-12-27 04:02:44,623 INFO L226 Difference]: Without dead ends: 35509 [2019-12-27 04:02:44,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:02:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35509 states. [2019-12-27 04:02:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35509 to 20136. [2019-12-27 04:02:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20136 states. [2019-12-27 04:02:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20136 states to 20136 states and 59716 transitions. [2019-12-27 04:02:45,055 INFO L78 Accepts]: Start accepts. Automaton has 20136 states and 59716 transitions. Word has length 66 [2019-12-27 04:02:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:45,055 INFO L462 AbstractCegarLoop]: Abstraction has 20136 states and 59716 transitions. [2019-12-27 04:02:45,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:02:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 20136 states and 59716 transitions. [2019-12-27 04:02:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:02:45,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:45,077 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:45,077 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash -617468203, now seen corresponding path program 5 times [2019-12-27 04:02:45,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:45,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956636225] [2019-12-27 04:02:45,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:45,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956636225] [2019-12-27 04:02:45,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:45,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:02:45,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011010681] [2019-12-27 04:02:45,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:02:45,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:45,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:02:45,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:02:45,198 INFO L87 Difference]: Start difference. First operand 20136 states and 59716 transitions. Second operand 9 states. [2019-12-27 04:02:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:46,395 INFO L93 Difference]: Finished difference Result 31481 states and 92778 transitions. [2019-12-27 04:02:46,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:02:46,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 04:02:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:46,436 INFO L225 Difference]: With dead ends: 31481 [2019-12-27 04:02:46,436 INFO L226 Difference]: Without dead ends: 30542 [2019-12-27 04:02:46,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:02:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30542 states. [2019-12-27 04:02:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30542 to 19728. [2019-12-27 04:02:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19728 states. [2019-12-27 04:02:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19728 states to 19728 states and 58539 transitions. [2019-12-27 04:02:46,812 INFO L78 Accepts]: Start accepts. Automaton has 19728 states and 58539 transitions. Word has length 66 [2019-12-27 04:02:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:46,812 INFO L462 AbstractCegarLoop]: Abstraction has 19728 states and 58539 transitions. [2019-12-27 04:02:46,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:02:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 19728 states and 58539 transitions. [2019-12-27 04:02:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:02:46,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:46,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:46,833 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-27 04:02:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:46,834 INFO L82 PathProgramCache]: Analyzing trace with hash 640702257, now seen corresponding path program 6 times [2019-12-27 04:02:46,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:46,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434028141] [2019-12-27 04:02:46,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:46,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434028141] [2019-12-27 04:02:47,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:47,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:02:47,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003546527] [2019-12-27 04:02:47,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:02:47,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:02:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:02:47,198 INFO L87 Difference]: Start difference. First operand 19728 states and 58539 transitions. Second operand 4 states. [2019-12-27 04:02:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:47,390 INFO L93 Difference]: Finished difference Result 22577 states and 67260 transitions. [2019-12-27 04:02:47,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:02:47,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 04:02:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:47,438 INFO L225 Difference]: With dead ends: 22577 [2019-12-27 04:02:47,439 INFO L226 Difference]: Without dead ends: 22577 [2019-12-27 04:02:47,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:02:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22577 states. [2019-12-27 04:02:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22577 to 17575. [2019-12-27 04:02:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17575 states. [2019-12-27 04:02:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17575 states to 17575 states and 52718 transitions. [2019-12-27 04:02:47,905 INFO L78 Accepts]: Start accepts. Automaton has 17575 states and 52718 transitions. Word has length 66 [2019-12-27 04:02:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:47,906 INFO L462 AbstractCegarLoop]: Abstraction has 17575 states and 52718 transitions. [2019-12-27 04:02:47,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:02:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17575 states and 52718 transitions. [2019-12-27 04:02:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:02:47,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:47,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:47,932 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-27 04:02:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 1 times [2019-12-27 04:02:47,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:47,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562057890] [2019-12-27 04:02:47,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:48,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562057890] [2019-12-27 04:02:48,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:48,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 04:02:48,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684062382] [2019-12-27 04:02:48,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:02:48,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:48,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:02:48,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:02:48,629 INFO L87 Difference]: Start difference. First operand 17575 states and 52718 transitions. Second operand 18 states. [2019-12-27 04:02:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:52,091 INFO L93 Difference]: Finished difference Result 23748 states and 70282 transitions. [2019-12-27 04:02:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 04:02:52,091 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 04:02:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:52,124 INFO L225 Difference]: With dead ends: 23748 [2019-12-27 04:02:52,124 INFO L226 Difference]: Without dead ends: 23283 [2019-12-27 04:02:52,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=1414, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:02:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2019-12-27 04:02:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 17315. [2019-12-27 04:02:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17315 states. [2019-12-27 04:02:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17315 states to 17315 states and 52056 transitions. [2019-12-27 04:02:52,433 INFO L78 Accepts]: Start accepts. Automaton has 17315 states and 52056 transitions. Word has length 67 [2019-12-27 04:02:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:52,433 INFO L462 AbstractCegarLoop]: Abstraction has 17315 states and 52056 transitions. [2019-12-27 04:02:52,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:02:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 17315 states and 52056 transitions. [2019-12-27 04:02:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:02:52,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:52,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:52,451 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-27 04:02:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1771988187, now seen corresponding path program 1 times [2019-12-27 04:02:52,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:52,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089915887] [2019-12-27 04:02:52,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:52,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089915887] [2019-12-27 04:02:52,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:52,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:02:52,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078271900] [2019-12-27 04:02:52,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:02:52,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:52,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:02:52,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:02:52,647 INFO L87 Difference]: Start difference. First operand 17315 states and 52056 transitions. Second operand 11 states. [2019-12-27 04:02:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:55,679 INFO L93 Difference]: Finished difference Result 39653 states and 117000 transitions. [2019-12-27 04:02:55,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 04:02:55,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 04:02:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:55,733 INFO L225 Difference]: With dead ends: 39653 [2019-12-27 04:02:55,733 INFO L226 Difference]: Without dead ends: 39653 [2019-12-27 04:02:55,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 04:02:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39653 states. [2019-12-27 04:02:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39653 to 18193. [2019-12-27 04:02:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18193 states. [2019-12-27 04:02:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18193 states to 18193 states and 54499 transitions. [2019-12-27 04:02:56,159 INFO L78 Accepts]: Start accepts. Automaton has 18193 states and 54499 transitions. Word has length 67 [2019-12-27 04:02:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:56,159 INFO L462 AbstractCegarLoop]: Abstraction has 18193 states and 54499 transitions. [2019-12-27 04:02:56,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:02:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 18193 states and 54499 transitions. [2019-12-27 04:02:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:02:56,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:56,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:56,178 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1711385183, now seen corresponding path program 2 times [2019-12-27 04:02:56,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:56,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62629481] [2019-12-27 04:02:56,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:56,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62629481] [2019-12-27 04:02:56,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:56,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:02:56,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530776325] [2019-12-27 04:02:56,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:02:56,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:02:56,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:02:56,294 INFO L87 Difference]: Start difference. First operand 18193 states and 54499 transitions. Second operand 6 states. [2019-12-27 04:02:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:56,476 INFO L93 Difference]: Finished difference Result 17993 states and 53656 transitions. [2019-12-27 04:02:56,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:02:56,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 04:02:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:56,515 INFO L225 Difference]: With dead ends: 17993 [2019-12-27 04:02:56,515 INFO L226 Difference]: Without dead ends: 17993 [2019-12-27 04:02:56,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:02:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17993 states. [2019-12-27 04:02:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17993 to 16493. [2019-12-27 04:02:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16493 states. [2019-12-27 04:02:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16493 states to 16493 states and 49153 transitions. [2019-12-27 04:02:56,878 INFO L78 Accepts]: Start accepts. Automaton has 16493 states and 49153 transitions. Word has length 67 [2019-12-27 04:02:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:56,878 INFO L462 AbstractCegarLoop]: Abstraction has 16493 states and 49153 transitions. [2019-12-27 04:02:56,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:02:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16493 states and 49153 transitions. [2019-12-27 04:02:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:02:56,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:56,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:56,895 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:56,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:56,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 2 times [2019-12-27 04:02:56,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:56,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908306579] [2019-12-27 04:02:56,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:02:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:02:57,025 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:02:57,025 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:02:57,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2396~0.base_39| 4)) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39| 1)) (= v_~y$r_buff1_thd0~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39|)) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39|) |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2396~0.base_39|) (= |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_~#t2396~0.base=|v_ULTIMATE.start_main_~#t2396~0.base_39|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_37|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_25|, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ULTIMATE.start_main_~#t2396~0.offset=|v_ULTIMATE.start_main_~#t2396~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2398~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2396~0.base, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2398~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2397~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2396~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:02:57,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= 0 (mod v_~y$w_buff1_used~0_76 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:02:57,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2397~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11|) |v_ULTIMATE.start_main_~#t2397~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2397~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t2397~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2397~0.offset] because there is no mapped edge [2019-12-27 04:02:57,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2398~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2398~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2398~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11|) |v_ULTIMATE.start_main_~#t2398~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_11|, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2398~0.base, ULTIMATE.start_main_~#t2398~0.offset, #length] because there is no mapped edge [2019-12-27 04:02:57,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1998376846 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-1998376846| |P2Thread1of1ForFork2_#t~ite23_Out-1998376846|) (= ~y$w_buff1~0_In-1998376846 |P2Thread1of1ForFork2_#t~ite24_Out-1998376846|)) (and (= |P2Thread1of1ForFork2_#t~ite24_Out-1998376846| |P2Thread1of1ForFork2_#t~ite23_Out-1998376846|) (= ~y$w_buff1~0_In-1998376846 |P2Thread1of1ForFork2_#t~ite23_Out-1998376846|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1998376846 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd3~0_In-1998376846 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1998376846 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1998376846 256)) .cse1)))))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1998376846|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1998376846, ~y$w_buff1~0=~y$w_buff1~0_In-1998376846, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1998376846, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1998376846, ~weak$$choice2~0=~weak$$choice2~0_In-1998376846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1998376846} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1998376846|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1998376846|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1998376846, ~y$w_buff1~0=~y$w_buff1~0_In-1998376846, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1998376846, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1998376846, ~weak$$choice2~0=~weak$$choice2~0_In-1998376846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1998376846} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 04:02:57,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2146994316 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2146994316 |P2Thread1of1ForFork2_#t~ite26_Out-2146994316|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2146994316 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-2146994316 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-2146994316 256)) (and (= (mod ~y$r_buff1_thd3~0_In-2146994316 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork2_#t~ite27_Out-2146994316| |P2Thread1of1ForFork2_#t~ite26_Out-2146994316|)) (and (= |P2Thread1of1ForFork2_#t~ite27_Out-2146994316| ~y$w_buff0_used~0_In-2146994316) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite26_In-2146994316| |P2Thread1of1ForFork2_#t~ite26_Out-2146994316|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2146994316, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-2146994316|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146994316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2146994316, ~weak$$choice2~0=~weak$$choice2~0_In-2146994316, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2146994316} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-2146994316|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2146994316, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146994316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2146994316, ~weak$$choice2~0=~weak$$choice2~0_In-2146994316, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-2146994316|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2146994316} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 04:02:57,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1846103698 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-1846103698| ~y$w_buff1_used~0_In-1846103698) (= |P2Thread1of1ForFork2_#t~ite29_In-1846103698| |P2Thread1of1ForFork2_#t~ite29_Out-1846103698|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-1846103698| ~y$w_buff1_used~0_In-1846103698) .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-1846103698| |P2Thread1of1ForFork2_#t~ite30_Out-1846103698|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1846103698 256) 0))) (or (and (= (mod ~y$r_buff1_thd3~0_In-1846103698 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1846103698 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1846103698 256)) .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1846103698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1846103698, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1846103698, ~weak$$choice2~0=~weak$$choice2~0_In-1846103698, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1846103698|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1846103698} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1846103698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1846103698, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1846103698|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1846103698, ~weak$$choice2~0=~weak$$choice2~0_In-1846103698, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1846103698|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1846103698} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 04:02:57,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 04:02:57,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 04:02:57,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-773756185 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-773756185 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-773756185| ~y$w_buff1~0_In-773756185)) (and (or .cse0 .cse1) (= ~y~0_In-773756185 |P2Thread1of1ForFork2_#t~ite38_Out-773756185|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-773756185, ~y$w_buff1~0=~y$w_buff1~0_In-773756185, ~y~0=~y~0_In-773756185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-773756185} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-773756185, ~y$w_buff1~0=~y$w_buff1~0_In-773756185, ~y~0=~y~0_In-773756185, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-773756185|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-773756185} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 04:02:57,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In511184576 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In511184576 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out511184576| ~y$w_buff0_used~0_In511184576) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out511184576| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In511184576, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In511184576} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out511184576|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In511184576, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In511184576} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 04:02:57,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1778255909 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1778255909 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1778255909 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1778255909 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1778255909 |P0Thread1of1ForFork0_#t~ite6_Out1778255909|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1778255909| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1778255909, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1778255909, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1778255909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1778255909} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1778255909|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1778255909, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1778255909, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1778255909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1778255909} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 04:02:57,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out636015724| |P1Thread1of1ForFork1_#t~ite10_Out636015724|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In636015724 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In636015724 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out636015724| ~y$w_buff1~0_In636015724) (not .cse1) (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out636015724| ~y~0_In636015724) .cse0 (or .cse1 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In636015724, ~y$w_buff1~0=~y$w_buff1~0_In636015724, ~y~0=~y~0_In636015724, ~y$w_buff1_used~0=~y$w_buff1_used~0_In636015724} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In636015724, ~y$w_buff1~0=~y$w_buff1~0_In636015724, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out636015724|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out636015724|, ~y~0=~y~0_In636015724, ~y$w_buff1_used~0=~y$w_buff1_used~0_In636015724} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 04:02:57,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_12|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_12|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_11|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 04:02:57,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1527721626 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1527721626 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out1527721626| ~y$w_buff0_used~0_In1527721626)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out1527721626| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1527721626, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1527721626} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1527721626, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1527721626, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1527721626|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 04:02:57,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-897173590 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-897173590 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-897173590 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-897173590 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-897173590| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite41_Out-897173590| ~y$w_buff1_used~0_In-897173590) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-897173590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-897173590, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-897173590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-897173590} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-897173590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-897173590, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-897173590|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-897173590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-897173590} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 04:02:57,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-686834723 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-686834723 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-686834723| ~y$r_buff0_thd3~0_In-686834723)) (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-686834723|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-686834723, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-686834723} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-686834723, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-686834723|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-686834723} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 04:02:57,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2078452840 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-2078452840 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2078452840 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-2078452840 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-2078452840 |P2Thread1of1ForFork2_#t~ite43_Out-2078452840|)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out-2078452840| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2078452840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2078452840, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2078452840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2078452840} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2078452840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2078452840, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2078452840, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-2078452840|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2078452840} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 04:02:57,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1397541558 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1397541558 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out1397541558 ~y$r_buff0_thd1~0_In1397541558)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1397541558)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1397541558, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1397541558} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1397541558, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1397541558|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1397541558} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 04:02:57,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1594899827 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1594899827 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1594899827 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1594899827 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1594899827 |P0Thread1of1ForFork0_#t~ite8_Out1594899827|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1594899827|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1594899827, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1594899827, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1594899827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1594899827} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1594899827, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1594899827, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1594899827|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1594899827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1594899827} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 04:02:57,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 04:02:57,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_34| v_~y$r_buff1_thd3~0_152) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 04:02:57,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-338530453 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-338530453 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-338530453| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-338530453 |P1Thread1of1ForFork1_#t~ite11_Out-338530453|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-338530453, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-338530453} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-338530453, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-338530453, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-338530453|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 04:02:57,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1113579076 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1113579076 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1113579076 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1113579076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1113579076|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1113579076 |P1Thread1of1ForFork1_#t~ite12_Out1113579076|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1113579076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1113579076, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1113579076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1113579076} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1113579076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1113579076, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1113579076, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1113579076|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1113579076} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 04:02:57,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-388883221 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-388883221 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-388883221| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-388883221| ~y$r_buff0_thd2~0_In-388883221)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-388883221, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-388883221} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-388883221, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-388883221, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-388883221|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 04:02:57,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-1313510262 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1313510262 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1313510262 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1313510262 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1313510262| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1313510262 |P1Thread1of1ForFork1_#t~ite14_Out-1313510262|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1313510262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313510262, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1313510262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1313510262} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1313510262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313510262, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1313510262, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1313510262|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1313510262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 04:02:57,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 04:02:57,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 04:02:57,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In202374051 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In202374051 256) 0))) (or (and (= ~y~0_In202374051 |ULTIMATE.start_main_#t~ite47_Out202374051|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out202374051| ~y$w_buff1~0_In202374051) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In202374051, ~y~0=~y~0_In202374051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In202374051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In202374051} OutVars{~y$w_buff1~0=~y$w_buff1~0_In202374051, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out202374051|, ~y~0=~y~0_In202374051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In202374051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In202374051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 04:02:57,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-27 04:02:57,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-111065885 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-111065885 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-111065885| ~y$w_buff0_used~0_In-111065885) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-111065885|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-111065885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-111065885} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-111065885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-111065885, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-111065885|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 04:02:57,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In139134697 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In139134697 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In139134697 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In139134697 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out139134697| ~y$w_buff1_used~0_In139134697) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite50_Out139134697|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In139134697, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In139134697, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In139134697, ~y$w_buff1_used~0=~y$w_buff1_used~0_In139134697} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out139134697|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In139134697, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In139134697, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In139134697, ~y$w_buff1_used~0=~y$w_buff1_used~0_In139134697} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 04:02:57,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1000805938 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1000805938 256)))) (or (and (= ~y$r_buff0_thd0~0_In1000805938 |ULTIMATE.start_main_#t~ite51_Out1000805938|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1000805938| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1000805938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1000805938} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1000805938|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1000805938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1000805938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 04:02:57,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1003939402 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1003939402 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1003939402 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1003939402 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1003939402| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out-1003939402| ~y$r_buff1_thd0~0_In-1003939402) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1003939402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1003939402, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1003939402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1003939402} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1003939402|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1003939402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1003939402, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1003939402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1003939402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 04:02:57,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= 2 v_~x~0_130) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 04:02:57,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:02:57 BasicIcfg [2019-12-27 04:02:57,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:02:57,157 INFO L168 Benchmark]: Toolchain (without parser) took 97732.62 ms. Allocated memory was 137.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 99.2 MB in the beginning and 996.5 MB in the end (delta: -897.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 04:02:57,158 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 04:02:57,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.06 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 154.5 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:02:57,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.22 ms. Allocated memory is still 201.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:02:57,159 INFO L168 Benchmark]: Boogie Preprocessor took 46.36 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:02:57,160 INFO L168 Benchmark]: RCFGBuilder took 875.80 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 99.3 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:02:57,160 INFO L168 Benchmark]: TraceAbstraction took 95942.78 ms. Allocated memory was 201.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.3 MB in the beginning and 996.5 MB in the end (delta: -897.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 04:02:57,162 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.06 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 154.5 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.22 ms. Allocated memory is still 201.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.36 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.80 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 99.3 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95942.78 ms. Allocated memory was 201.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.3 MB in the beginning and 996.5 MB in the end (delta: -897.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 95.5s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5969 SDtfs, 7676 SDslu, 20660 SDs, 0 SdLazy, 13879 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 39 SyntacticMatches, 23 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148639occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 184539 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1185 NumberOfCodeBlocks, 1185 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1093 ConstructedInterpolants, 0 QuantifiedInterpolants, 300691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...