/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:50:11,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:50:11,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:50:11,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:50:11,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:50:11,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:50:11,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:50:11,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:50:11,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:50:11,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:50:11,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:50:11,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:50:11,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:50:11,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:50:11,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:50:11,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:50:11,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:50:11,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:50:11,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:50:11,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:50:11,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:50:11,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:50:11,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:50:11,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:50:11,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:50:11,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:50:11,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:50:11,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:50:11,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:50:11,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:50:11,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:50:11,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:50:11,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:50:11,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:50:11,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:50:11,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:50:11,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:50:11,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:50:11,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:50:11,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:50:11,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:50:11,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:50:11,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:50:11,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:50:11,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:50:11,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:50:11,312 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:50:11,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:50:11,313 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:50:11,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:50:11,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:50:11,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:50:11,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:50:11,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:50:11,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:50:11,314 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:50:11,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:50:11,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:50:11,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:50:11,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:50:11,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:50:11,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:50:11,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:50:11,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:50:11,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:50:11,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:50:11,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:50:11,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:50:11,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:50:11,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:50:11,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:50:11,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:50:11,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:50:11,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:50:11,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:50:11,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:50:11,623 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:50:11,624 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-18 20:50:11,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca1001cd/f871c4a6212c455bbb0667d70cdd5a74/FLAGc6fb0052e [2019-12-18 20:50:12,258 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:50:12,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-18 20:50:12,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca1001cd/f871c4a6212c455bbb0667d70cdd5a74/FLAGc6fb0052e [2019-12-18 20:50:12,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca1001cd/f871c4a6212c455bbb0667d70cdd5a74 [2019-12-18 20:50:12,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:50:12,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:50:12,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:50:12,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:50:12,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:50:12,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:50:12" (1/1) ... [2019-12-18 20:50:12,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:12, skipping insertion in model container [2019-12-18 20:50:12,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:50:12" (1/1) ... [2019-12-18 20:50:12,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:50:12,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:50:13,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:50:13,148 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:50:13,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:50:13,354 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:50:13,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13 WrapperNode [2019-12-18 20:50:13,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:50:13,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:50:13,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:50:13,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:50:13,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:50:13,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:50:13,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:50:13,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:50:13,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... [2019-12-18 20:50:13,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:50:13,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:50:13,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:50:13,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:50:13,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:50:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:50:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:50:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:50:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:50:13,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:50:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:50:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:50:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:50:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:50:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:50:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:50:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:50:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:50:13,539 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:50:14,274 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:50:14,275 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:50:14,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:50:14 BoogieIcfgContainer [2019-12-18 20:50:14,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:50:14,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:50:14,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:50:14,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:50:14,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:50:12" (1/3) ... [2019-12-18 20:50:14,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40322f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:50:14, skipping insertion in model container [2019-12-18 20:50:14,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:50:13" (2/3) ... [2019-12-18 20:50:14,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40322f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:50:14, skipping insertion in model container [2019-12-18 20:50:14,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:50:14" (3/3) ... [2019-12-18 20:50:14,285 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.opt.i [2019-12-18 20:50:14,296 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:50:14,296 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:50:14,307 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:50:14,308 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:50:14,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,359 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,359 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,360 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,371 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,371 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,430 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,432 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,440 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,440 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:50:14,471 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:50:14,491 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:50:14,491 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:50:14,491 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:50:14,492 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:50:14,492 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:50:14,492 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:50:14,492 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:50:14,492 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:50:14,509 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 20:50:14,511 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 20:50:14,606 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 20:50:14,606 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:50:14,627 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:50:14,658 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 20:50:14,736 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 20:50:14,737 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:50:14,744 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:50:14,764 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:50:14,765 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:50:18,268 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 20:50:18,389 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 20:50:18,416 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-18 20:50:18,417 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 20:50:18,421 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 20:50:39,187 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-18 20:50:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-18 20:50:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:50:39,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:39,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:50:39,196 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:39,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-18 20:50:39,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:39,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656191316] [2019-12-18 20:50:39,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:39,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656191316] [2019-12-18 20:50:39,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:39,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:50:39,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604280952] [2019-12-18 20:50:39,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:39,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:39,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:39,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:39,463 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-18 20:50:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:42,834 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-18 20:50:42,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:42,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:50:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:43,481 INFO L225 Difference]: With dead ends: 120482 [2019-12-18 20:50:43,481 INFO L226 Difference]: Without dead ends: 113384 [2019-12-18 20:50:43,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-18 20:50:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-18 20:50:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-18 20:50:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-18 20:50:53,830 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-18 20:50:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:53,830 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-18 20:50:53,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-18 20:50:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:50:53,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:53,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:53,835 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-18 20:50:53,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:53,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304046531] [2019-12-18 20:50:53,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:53,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304046531] [2019-12-18 20:50:53,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:53,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:53,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443081472] [2019-12-18 20:50:53,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:53,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:53,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:53,950 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-18 20:51:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:00,099 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-18 20:51:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:51:00,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:51:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:00,745 INFO L225 Difference]: With dead ends: 179498 [2019-12-18 20:51:00,746 INFO L226 Difference]: Without dead ends: 179449 [2019-12-18 20:51:00,746 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-18 20:51:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-18 20:51:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-18 20:51:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-18 20:51:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-18 20:51:16,657 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-18 20:51:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:16,657 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-18 20:51:16,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:51:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-18 20:51:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:51:16,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:16,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:16,663 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:16,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:16,664 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-18 20:51:16,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:16,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918697633] [2019-12-18 20:51:16,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:16,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918697633] [2019-12-18 20:51:16,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:16,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:51:16,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669190551] [2019-12-18 20:51:16,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:51:16,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:51:16,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:16,730 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-18 20:51:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:16,873 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-18 20:51:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:51:16,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:51:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:16,984 INFO L225 Difference]: With dead ends: 34413 [2019-12-18 20:51:16,984 INFO L226 Difference]: Without dead ends: 34413 [2019-12-18 20:51:16,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-18 20:51:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-18 20:51:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-18 20:51:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-18 20:51:17,800 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-18 20:51:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:17,800 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-18 20:51:17,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:51:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-18 20:51:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:51:17,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:17,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:17,803 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-18 20:51:17,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:17,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864526857] [2019-12-18 20:51:17,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:17,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864526857] [2019-12-18 20:51:17,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:17,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:51:17,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374456527] [2019-12-18 20:51:17,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:51:17,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:51:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:17,875 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-18 20:51:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:18,114 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-18 20:51:18,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:51:18,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 20:51:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:19,676 INFO L225 Difference]: With dead ends: 54627 [2019-12-18 20:51:19,676 INFO L226 Difference]: Without dead ends: 54627 [2019-12-18 20:51:19,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-18 20:51:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-18 20:51:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-18 20:51:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-18 20:51:20,578 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-18 20:51:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:20,579 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-18 20:51:20,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:51:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-18 20:51:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:51:20,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:20,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:20,583 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:20,583 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-18 20:51:20,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:20,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885418140] [2019-12-18 20:51:20,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:20,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885418140] [2019-12-18 20:51:20,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:20,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:51:20,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903287252] [2019-12-18 20:51:20,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:51:20,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:20,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:51:20,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:51:20,736 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-18 20:51:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:21,141 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-18 20:51:21,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:51:21,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:51:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:21,219 INFO L225 Difference]: With dead ends: 48927 [2019-12-18 20:51:21,219 INFO L226 Difference]: Without dead ends: 48927 [2019-12-18 20:51:21,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-18 20:51:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-18 20:51:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-18 20:51:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-18 20:51:24,929 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-18 20:51:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:24,929 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-18 20:51:24,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:51:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-18 20:51:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:51:24,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:24,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:24,933 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-18 20:51:24,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:24,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874205535] [2019-12-18 20:51:24,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:25,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874205535] [2019-12-18 20:51:25,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:25,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:51:25,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339933837] [2019-12-18 20:51:25,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:51:25,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:25,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:51:25,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:51:25,009 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-18 20:51:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:25,425 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-18 20:51:25,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:51:25,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:51:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:25,536 INFO L225 Difference]: With dead ends: 53251 [2019-12-18 20:51:25,537 INFO L226 Difference]: Without dead ends: 53251 [2019-12-18 20:51:25,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-18 20:51:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-18 20:51:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-18 20:51:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-18 20:51:26,350 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-18 20:51:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:26,351 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-18 20:51:26,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:51:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-18 20:51:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:51:26,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:26,360 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-18 20:51:26,360 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-18 20:51:26,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:26,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72465413] [2019-12-18 20:51:26,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:26,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72465413] [2019-12-18 20:51:26,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:26,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:51:26,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396689480] [2019-12-18 20:51:26,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:51:26,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:26,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:51:26,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:26,506 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 5 states. [2019-12-18 20:51:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:27,169 INFO L93 Difference]: Finished difference Result 63192 states and 200300 transitions. [2019-12-18 20:51:27,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:51:27,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:51:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:27,273 INFO L225 Difference]: With dead ends: 63192 [2019-12-18 20:51:27,273 INFO L226 Difference]: Without dead ends: 63185 [2019-12-18 20:51:27,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:51:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63185 states. [2019-12-18 20:51:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63185 to 47511. [2019-12-18 20:51:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47511 states. [2019-12-18 20:51:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47511 states to 47511 states and 154018 transitions. [2019-12-18 20:51:28,556 INFO L78 Accepts]: Start accepts. Automaton has 47511 states and 154018 transitions. Word has length 22 [2019-12-18 20:51:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:28,556 INFO L462 AbstractCegarLoop]: Abstraction has 47511 states and 154018 transitions. [2019-12-18 20:51:28,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:51:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 47511 states and 154018 transitions. [2019-12-18 20:51:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:51:28,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:28,563 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-18 20:51:28,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-18 20:51:28,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:28,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506105137] [2019-12-18 20:51:28,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:28,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506105137] [2019-12-18 20:51:28,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:28,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:51:28,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420451904] [2019-12-18 20:51:28,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:51:28,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:28,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:51:28,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:28,657 INFO L87 Difference]: Start difference. First operand 47511 states and 154018 transitions. Second operand 5 states. [2019-12-18 20:51:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:29,307 INFO L93 Difference]: Finished difference Result 65538 states and 207239 transitions. [2019-12-18 20:51:29,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:51:29,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:51:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:29,414 INFO L225 Difference]: With dead ends: 65538 [2019-12-18 20:51:29,414 INFO L226 Difference]: Without dead ends: 65531 [2019-12-18 20:51:29,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:51:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65531 states. [2019-12-18 20:51:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65531 to 45771. [2019-12-18 20:51:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45771 states. [2019-12-18 20:51:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45771 states to 45771 states and 148366 transitions. [2019-12-18 20:51:30,699 INFO L78 Accepts]: Start accepts. Automaton has 45771 states and 148366 transitions. Word has length 22 [2019-12-18 20:51:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:30,699 INFO L462 AbstractCegarLoop]: Abstraction has 45771 states and 148366 transitions. [2019-12-18 20:51:30,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:51:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 45771 states and 148366 transitions. [2019-12-18 20:51:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:51:30,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:30,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:30,711 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-18 20:51:30,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:30,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582945344] [2019-12-18 20:51:30,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:30,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582945344] [2019-12-18 20:51:30,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:30,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:51:30,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439482896] [2019-12-18 20:51:30,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:51:30,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:30,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:51:30,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:51:30,762 INFO L87 Difference]: Start difference. First operand 45771 states and 148366 transitions. Second operand 4 states. [2019-12-18 20:51:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:30,838 INFO L93 Difference]: Finished difference Result 17755 states and 54382 transitions. [2019-12-18 20:51:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:51:30,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:51:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:30,869 INFO L225 Difference]: With dead ends: 17755 [2019-12-18 20:51:30,869 INFO L226 Difference]: Without dead ends: 17755 [2019-12-18 20:51:30,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:51:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17755 states. [2019-12-18 20:51:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17755 to 17427. [2019-12-18 20:51:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-18 20:51:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 53446 transitions. [2019-12-18 20:51:31,122 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 53446 transitions. Word has length 25 [2019-12-18 20:51:31,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:31,123 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 53446 transitions. [2019-12-18 20:51:31,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:51:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 53446 transitions. [2019-12-18 20:51:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:51:31,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:31,136 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-18 20:51:31,136 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-18 20:51:31,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:31,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434223533] [2019-12-18 20:51:31,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:31,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434223533] [2019-12-18 20:51:31,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:31,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:51:31,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163538528] [2019-12-18 20:51:31,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:51:31,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:51:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:31,223 INFO L87 Difference]: Start difference. First operand 17427 states and 53446 transitions. Second operand 5 states. [2019-12-18 20:51:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:31,554 INFO L93 Difference]: Finished difference Result 22078 states and 66584 transitions. [2019-12-18 20:51:31,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:51:31,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:51:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:31,584 INFO L225 Difference]: With dead ends: 22078 [2019-12-18 20:51:31,584 INFO L226 Difference]: Without dead ends: 22078 [2019-12-18 20:51:31,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:51:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22078 states. [2019-12-18 20:51:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22078 to 20690. [2019-12-18 20:51:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20690 states. [2019-12-18 20:51:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 63094 transitions. [2019-12-18 20:51:31,887 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 63094 transitions. Word has length 27 [2019-12-18 20:51:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:31,887 INFO L462 AbstractCegarLoop]: Abstraction has 20690 states and 63094 transitions. [2019-12-18 20:51:31,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:51:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 63094 transitions. [2019-12-18 20:51:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:51:31,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:31,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:31,902 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:31,902 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-18 20:51:31,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:31,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979694208] [2019-12-18 20:51:31,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:31,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979694208] [2019-12-18 20:51:31,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:31,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:51:31,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812145025] [2019-12-18 20:51:31,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:51:31,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:31,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:51:31,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:31,994 INFO L87 Difference]: Start difference. First operand 20690 states and 63094 transitions. Second operand 5 states. [2019-12-18 20:51:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:32,107 INFO L93 Difference]: Finished difference Result 21192 states and 64429 transitions. [2019-12-18 20:51:32,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:51:32,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:51:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:32,135 INFO L225 Difference]: With dead ends: 21192 [2019-12-18 20:51:32,135 INFO L226 Difference]: Without dead ends: 21192 [2019-12-18 20:51:32,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21192 states. [2019-12-18 20:51:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21192 to 21192. [2019-12-18 20:51:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-12-18 20:51:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 64429 transitions. [2019-12-18 20:51:32,609 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 64429 transitions. Word has length 28 [2019-12-18 20:51:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:32,610 INFO L462 AbstractCegarLoop]: Abstraction has 21192 states and 64429 transitions. [2019-12-18 20:51:32,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:51:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 64429 transitions. [2019-12-18 20:51:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 20:51:32,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:32,626 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] [2019-12-18 20:51:32,626 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:32,626 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-18 20:51:32,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:32,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835103249] [2019-12-18 20:51:32,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:32,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835103249] [2019-12-18 20:51:32,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:32,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:51:32,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198087023] [2019-12-18 20:51:32,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:51:32,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:32,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:51:32,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:32,698 INFO L87 Difference]: Start difference. First operand 21192 states and 64429 transitions. Second operand 5 states. [2019-12-18 20:51:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:33,029 INFO L93 Difference]: Finished difference Result 24492 states and 73342 transitions. [2019-12-18 20:51:33,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:51:33,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 20:51:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:33,065 INFO L225 Difference]: With dead ends: 24492 [2019-12-18 20:51:33,065 INFO L226 Difference]: Without dead ends: 24492 [2019-12-18 20:51:33,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:51:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24492 states. [2019-12-18 20:51:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24492 to 20516. [2019-12-18 20:51:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-18 20:51:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 62500 transitions. [2019-12-18 20:51:33,376 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 62500 transitions. Word has length 29 [2019-12-18 20:51:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:33,376 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 62500 transitions. [2019-12-18 20:51:33,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:51:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 62500 transitions. [2019-12-18 20:51:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:51:33,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:33,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:33,397 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-18 20:51:33,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:33,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45187890] [2019-12-18 20:51:33,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:33,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45187890] [2019-12-18 20:51:33,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:33,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:51:33,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484915189] [2019-12-18 20:51:33,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:51:33,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:51:33,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:51:33,501 INFO L87 Difference]: Start difference. First operand 20516 states and 62500 transitions. Second operand 6 states. [2019-12-18 20:51:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:34,220 INFO L93 Difference]: Finished difference Result 27891 states and 82809 transitions. [2019-12-18 20:51:34,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:51:34,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 20:51:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:34,265 INFO L225 Difference]: With dead ends: 27891 [2019-12-18 20:51:34,265 INFO L226 Difference]: Without dead ends: 27891 [2019-12-18 20:51:34,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:51:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27891 states. [2019-12-18 20:51:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27891 to 21560. [2019-12-18 20:51:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21560 states. [2019-12-18 20:51:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21560 states to 21560 states and 65334 transitions. [2019-12-18 20:51:34,608 INFO L78 Accepts]: Start accepts. Automaton has 21560 states and 65334 transitions. Word has length 33 [2019-12-18 20:51:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:34,608 INFO L462 AbstractCegarLoop]: Abstraction has 21560 states and 65334 transitions. [2019-12-18 20:51:34,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:51:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 21560 states and 65334 transitions. [2019-12-18 20:51:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:51:34,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:34,626 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] [2019-12-18 20:51:34,626 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-18 20:51:34,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:34,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941016357] [2019-12-18 20:51:34,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:34,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941016357] [2019-12-18 20:51:34,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:34,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:51:34,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618747924] [2019-12-18 20:51:34,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:51:34,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:51:34,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:51:34,714 INFO L87 Difference]: Start difference. First operand 21560 states and 65334 transitions. Second operand 6 states. [2019-12-18 20:51:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:35,376 INFO L93 Difference]: Finished difference Result 27170 states and 81035 transitions. [2019-12-18 20:51:35,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:51:35,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 20:51:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:35,413 INFO L225 Difference]: With dead ends: 27170 [2019-12-18 20:51:35,413 INFO L226 Difference]: Without dead ends: 27170 [2019-12-18 20:51:35,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:51:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27170 states. [2019-12-18 20:51:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27170 to 18453. [2019-12-18 20:51:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18453 states. [2019-12-18 20:51:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18453 states to 18453 states and 56474 transitions. [2019-12-18 20:51:35,842 INFO L78 Accepts]: Start accepts. Automaton has 18453 states and 56474 transitions. Word has length 35 [2019-12-18 20:51:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:35,843 INFO L462 AbstractCegarLoop]: Abstraction has 18453 states and 56474 transitions. [2019-12-18 20:51:35,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:51:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 18453 states and 56474 transitions. [2019-12-18 20:51:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:51:35,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:35,860 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-18 20:51:35,860 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-18 20:51:35,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:35,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895966769] [2019-12-18 20:51:35,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:35,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895966769] [2019-12-18 20:51:35,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:35,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:51:35,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811014012] [2019-12-18 20:51:35,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:51:35,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:35,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:51:35,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:35,910 INFO L87 Difference]: Start difference. First operand 18453 states and 56474 transitions. Second operand 3 states. [2019-12-18 20:51:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:36,035 INFO L93 Difference]: Finished difference Result 34876 states and 106833 transitions. [2019-12-18 20:51:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:51:36,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:51:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:36,070 INFO L225 Difference]: With dead ends: 34876 [2019-12-18 20:51:36,070 INFO L226 Difference]: Without dead ends: 18951 [2019-12-18 20:51:36,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2019-12-18 20:51:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18887. [2019-12-18 20:51:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18887 states. [2019-12-18 20:51:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18887 states to 18887 states and 56346 transitions. [2019-12-18 20:51:36,526 INFO L78 Accepts]: Start accepts. Automaton has 18887 states and 56346 transitions. Word has length 39 [2019-12-18 20:51:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:36,527 INFO L462 AbstractCegarLoop]: Abstraction has 18887 states and 56346 transitions. [2019-12-18 20:51:36,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:51:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 18887 states and 56346 transitions. [2019-12-18 20:51:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:51:36,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:36,552 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-18 20:51:36,552 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:36,553 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-18 20:51:36,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:36,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955066226] [2019-12-18 20:51:36,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:36,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955066226] [2019-12-18 20:51:36,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:36,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:51:36,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452728423] [2019-12-18 20:51:36,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:51:36,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:51:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:36,648 INFO L87 Difference]: Start difference. First operand 18887 states and 56346 transitions. Second operand 5 states. [2019-12-18 20:51:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:37,227 INFO L93 Difference]: Finished difference Result 26904 states and 79492 transitions. [2019-12-18 20:51:37,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:51:37,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:51:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:37,264 INFO L225 Difference]: With dead ends: 26904 [2019-12-18 20:51:37,264 INFO L226 Difference]: Without dead ends: 26904 [2019-12-18 20:51:37,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:51:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26904 states. [2019-12-18 20:51:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26904 to 24978. [2019-12-18 20:51:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24978 states. [2019-12-18 20:51:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24978 states to 24978 states and 74337 transitions. [2019-12-18 20:51:37,631 INFO L78 Accepts]: Start accepts. Automaton has 24978 states and 74337 transitions. Word has length 40 [2019-12-18 20:51:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:37,631 INFO L462 AbstractCegarLoop]: Abstraction has 24978 states and 74337 transitions. [2019-12-18 20:51:37,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:51:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24978 states and 74337 transitions. [2019-12-18 20:51:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:51:37,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:37,662 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-18 20:51:37,662 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-18 20:51:37,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:37,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820518411] [2019-12-18 20:51:37,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:37,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820518411] [2019-12-18 20:51:37,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:37,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:51:37,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978736939] [2019-12-18 20:51:37,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:51:37,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:37,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:51:37,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:37,720 INFO L87 Difference]: Start difference. First operand 24978 states and 74337 transitions. Second operand 5 states. [2019-12-18 20:51:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:37,822 INFO L93 Difference]: Finished difference Result 23522 states and 70969 transitions. [2019-12-18 20:51:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:51:37,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:51:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:37,866 INFO L225 Difference]: With dead ends: 23522 [2019-12-18 20:51:37,866 INFO L226 Difference]: Without dead ends: 21728 [2019-12-18 20:51:37,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:51:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21728 states. [2019-12-18 20:51:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21728 to 20804. [2019-12-18 20:51:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20804 states. [2019-12-18 20:51:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20804 states to 20804 states and 64576 transitions. [2019-12-18 20:51:38,548 INFO L78 Accepts]: Start accepts. Automaton has 20804 states and 64576 transitions. Word has length 40 [2019-12-18 20:51:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:38,548 INFO L462 AbstractCegarLoop]: Abstraction has 20804 states and 64576 transitions. [2019-12-18 20:51:38,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:51:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 20804 states and 64576 transitions. [2019-12-18 20:51:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:51:38,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:38,579 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] [2019-12-18 20:51:38,579 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1469321779, now seen corresponding path program 1 times [2019-12-18 20:51:38,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:38,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713814378] [2019-12-18 20:51:38,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:38,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713814378] [2019-12-18 20:51:38,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:38,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:51:38,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818945658] [2019-12-18 20:51:38,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:51:38,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:38,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:51:38,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:51:38,674 INFO L87 Difference]: Start difference. First operand 20804 states and 64576 transitions. Second operand 7 states. [2019-12-18 20:51:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:39,215 INFO L93 Difference]: Finished difference Result 64056 states and 197500 transitions. [2019-12-18 20:51:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 20:51:39,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:51:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:39,290 INFO L225 Difference]: With dead ends: 64056 [2019-12-18 20:51:39,290 INFO L226 Difference]: Without dead ends: 47946 [2019-12-18 20:51:39,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:51:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47946 states. [2019-12-18 20:51:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47946 to 24293. [2019-12-18 20:51:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24293 states. [2019-12-18 20:51:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24293 states to 24293 states and 75873 transitions. [2019-12-18 20:51:39,840 INFO L78 Accepts]: Start accepts. Automaton has 24293 states and 75873 transitions. Word has length 64 [2019-12-18 20:51:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:39,840 INFO L462 AbstractCegarLoop]: Abstraction has 24293 states and 75873 transitions. [2019-12-18 20:51:39,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:51:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24293 states and 75873 transitions. [2019-12-18 20:51:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:51:39,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:39,863 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] [2019-12-18 20:51:39,863 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 572317973, now seen corresponding path program 2 times [2019-12-18 20:51:39,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:39,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853591628] [2019-12-18 20:51:39,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:39,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853591628] [2019-12-18 20:51:39,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:39,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:51:39,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920948305] [2019-12-18 20:51:39,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:51:39,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:51:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:51:39,940 INFO L87 Difference]: Start difference. First operand 24293 states and 75873 transitions. Second operand 7 states. [2019-12-18 20:51:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:40,414 INFO L93 Difference]: Finished difference Result 68097 states and 208875 transitions. [2019-12-18 20:51:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:51:40,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:51:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:40,483 INFO L225 Difference]: With dead ends: 68097 [2019-12-18 20:51:40,483 INFO L226 Difference]: Without dead ends: 47219 [2019-12-18 20:51:40,483 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-18 20:51:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47219 states. [2019-12-18 20:51:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47219 to 27552. [2019-12-18 20:51:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27552 states. [2019-12-18 20:51:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27552 states to 27552 states and 85874 transitions. [2019-12-18 20:51:41,261 INFO L78 Accepts]: Start accepts. Automaton has 27552 states and 85874 transitions. Word has length 64 [2019-12-18 20:51:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:41,261 INFO L462 AbstractCegarLoop]: Abstraction has 27552 states and 85874 transitions. [2019-12-18 20:51:41,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:51:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 27552 states and 85874 transitions. [2019-12-18 20:51:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:51:41,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:41,291 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] [2019-12-18 20:51:41,291 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash 584356249, now seen corresponding path program 3 times [2019-12-18 20:51:41,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:41,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959540546] [2019-12-18 20:51:41,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:41,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959540546] [2019-12-18 20:51:41,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:41,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:51:41,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056224034] [2019-12-18 20:51:41,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:51:41,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:41,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:51:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:51:41,383 INFO L87 Difference]: Start difference. First operand 27552 states and 85874 transitions. Second operand 7 states. [2019-12-18 20:51:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:41,825 INFO L93 Difference]: Finished difference Result 59727 states and 183443 transitions. [2019-12-18 20:51:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:51:41,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:51:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:41,899 INFO L225 Difference]: With dead ends: 59727 [2019-12-18 20:51:41,899 INFO L226 Difference]: Without dead ends: 52169 [2019-12-18 20:51:41,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:51:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52169 states. [2019-12-18 20:51:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52169 to 27860. [2019-12-18 20:51:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27860 states. [2019-12-18 20:51:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27860 states to 27860 states and 86825 transitions. [2019-12-18 20:51:42,500 INFO L78 Accepts]: Start accepts. Automaton has 27860 states and 86825 transitions. Word has length 64 [2019-12-18 20:51:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:42,500 INFO L462 AbstractCegarLoop]: Abstraction has 27860 states and 86825 transitions. [2019-12-18 20:51:42,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:51:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27860 states and 86825 transitions. [2019-12-18 20:51:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:51:42,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:42,530 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] [2019-12-18 20:51:42,531 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1340586405, now seen corresponding path program 4 times [2019-12-18 20:51:42,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:42,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628540654] [2019-12-18 20:51:42,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:42,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628540654] [2019-12-18 20:51:42,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:42,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:51:42,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410496448] [2019-12-18 20:51:42,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:51:42,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:42,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:51:42,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:42,589 INFO L87 Difference]: Start difference. First operand 27860 states and 86825 transitions. Second operand 3 states. [2019-12-18 20:51:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:42,778 INFO L93 Difference]: Finished difference Result 33798 states and 103981 transitions. [2019-12-18 20:51:42,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:51:42,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 20:51:42,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:42,842 INFO L225 Difference]: With dead ends: 33798 [2019-12-18 20:51:42,842 INFO L226 Difference]: Without dead ends: 33798 [2019-12-18 20:51:42,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33798 states. [2019-12-18 20:51:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33798 to 29485. [2019-12-18 20:51:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29485 states. [2019-12-18 20:51:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29485 states to 29485 states and 91533 transitions. [2019-12-18 20:51:43,573 INFO L78 Accepts]: Start accepts. Automaton has 29485 states and 91533 transitions. Word has length 64 [2019-12-18 20:51:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:43,573 INFO L462 AbstractCegarLoop]: Abstraction has 29485 states and 91533 transitions. [2019-12-18 20:51:43,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:51:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 29485 states and 91533 transitions. [2019-12-18 20:51:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:51:43,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:43,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:43,614 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash -87540519, now seen corresponding path program 1 times [2019-12-18 20:51:43,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:43,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702627873] [2019-12-18 20:51:43,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:43,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702627873] [2019-12-18 20:51:43,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:43,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 20:51:43,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242362773] [2019-12-18 20:51:43,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 20:51:43,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:43,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 20:51:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:51:43,871 INFO L87 Difference]: Start difference. First operand 29485 states and 91533 transitions. Second operand 13 states. [2019-12-18 20:51:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:47,867 INFO L93 Difference]: Finished difference Result 61445 states and 184819 transitions. [2019-12-18 20:51:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 20:51:47,868 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-18 20:51:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:47,969 INFO L225 Difference]: With dead ends: 61445 [2019-12-18 20:51:47,969 INFO L226 Difference]: Without dead ends: 61044 [2019-12-18 20:51:47,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=335, Invalid=1735, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 20:51:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61044 states. [2019-12-18 20:51:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61044 to 35088. [2019-12-18 20:51:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35088 states. [2019-12-18 20:51:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35088 states to 35088 states and 108205 transitions. [2019-12-18 20:51:48,715 INFO L78 Accepts]: Start accepts. Automaton has 35088 states and 108205 transitions. Word has length 65 [2019-12-18 20:51:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:48,715 INFO L462 AbstractCegarLoop]: Abstraction has 35088 states and 108205 transitions. [2019-12-18 20:51:48,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 20:51:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 35088 states and 108205 transitions. [2019-12-18 20:51:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:51:49,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:49,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:49,034 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash -801818747, now seen corresponding path program 2 times [2019-12-18 20:51:49,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:49,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007409108] [2019-12-18 20:51:49,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:49,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007409108] [2019-12-18 20:51:49,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:49,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:51:49,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372828756] [2019-12-18 20:51:49,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:51:49,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:49,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:51:49,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:51:49,239 INFO L87 Difference]: Start difference. First operand 35088 states and 108205 transitions. Second operand 9 states. [2019-12-18 20:51:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:51,133 INFO L93 Difference]: Finished difference Result 61141 states and 185190 transitions. [2019-12-18 20:51:51,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:51:51,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:51:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:51,223 INFO L225 Difference]: With dead ends: 61141 [2019-12-18 20:51:51,223 INFO L226 Difference]: Without dead ends: 60921 [2019-12-18 20:51:51,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-18 20:51:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60921 states. [2019-12-18 20:51:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60921 to 41808. [2019-12-18 20:51:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41808 states. [2019-12-18 20:51:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41808 states to 41808 states and 128693 transitions. [2019-12-18 20:51:52,006 INFO L78 Accepts]: Start accepts. Automaton has 41808 states and 128693 transitions. Word has length 65 [2019-12-18 20:51:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:52,006 INFO L462 AbstractCegarLoop]: Abstraction has 41808 states and 128693 transitions. [2019-12-18 20:51:52,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:51:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 41808 states and 128693 transitions. [2019-12-18 20:51:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:51:52,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:52,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:52,051 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:52,052 INFO L82 PathProgramCache]: Analyzing trace with hash 69716979, now seen corresponding path program 3 times [2019-12-18 20:51:52,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:52,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926734005] [2019-12-18 20:51:52,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:52,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926734005] [2019-12-18 20:51:52,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:52,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:51:52,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971777852] [2019-12-18 20:51:52,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:51:52,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:51:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:52,116 INFO L87 Difference]: Start difference. First operand 41808 states and 128693 transitions. Second operand 3 states. [2019-12-18 20:51:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:52,268 INFO L93 Difference]: Finished difference Result 41807 states and 128691 transitions. [2019-12-18 20:51:52,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:51:52,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:51:52,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:52,332 INFO L225 Difference]: With dead ends: 41807 [2019-12-18 20:51:52,332 INFO L226 Difference]: Without dead ends: 41807 [2019-12-18 20:51:52,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41807 states. [2019-12-18 20:51:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41807 to 33219. [2019-12-18 20:51:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33219 states. [2019-12-18 20:51:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33219 states to 33219 states and 103897 transitions. [2019-12-18 20:51:53,204 INFO L78 Accepts]: Start accepts. Automaton has 33219 states and 103897 transitions. Word has length 65 [2019-12-18 20:51:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:53,204 INFO L462 AbstractCegarLoop]: Abstraction has 33219 states and 103897 transitions. [2019-12-18 20:51:53,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:51:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 33219 states and 103897 transitions. [2019-12-18 20:51:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:51:53,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:53,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:53,243 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-18 20:51:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2032409417, now seen corresponding path program 1 times [2019-12-18 20:51:53,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:53,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171718409] [2019-12-18 20:51:53,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:53,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171718409] [2019-12-18 20:51:53,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:53,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:51:53,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836412715] [2019-12-18 20:51:53,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:51:53,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:53,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:51:53,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:53,329 INFO L87 Difference]: Start difference. First operand 33219 states and 103897 transitions. Second operand 3 states. [2019-12-18 20:51:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:53,441 INFO L93 Difference]: Finished difference Result 24865 states and 76584 transitions. [2019-12-18 20:51:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:51:53,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:51:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:53,488 INFO L225 Difference]: With dead ends: 24865 [2019-12-18 20:51:53,488 INFO L226 Difference]: Without dead ends: 24865 [2019-12-18 20:51:53,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:51:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24865 states. [2019-12-18 20:51:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24865 to 23724. [2019-12-18 20:51:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23724 states. [2019-12-18 20:51:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23724 states to 23724 states and 72991 transitions. [2019-12-18 20:51:53,865 INFO L78 Accepts]: Start accepts. Automaton has 23724 states and 72991 transitions. Word has length 66 [2019-12-18 20:51:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:53,865 INFO L462 AbstractCegarLoop]: Abstraction has 23724 states and 72991 transitions. [2019-12-18 20:51:53,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:51:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 23724 states and 72991 transitions. [2019-12-18 20:51:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:51:53,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:53,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, 1] [2019-12-18 20:51:53,888 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-18 20:51:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:53,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-18 20:51:53,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:53,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143424168] [2019-12-18 20:51:53,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:54,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143424168] [2019-12-18 20:51:54,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:54,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 20:51:54,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914783606] [2019-12-18 20:51:54,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 20:51:54,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 20:51:54,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:51:54,396 INFO L87 Difference]: Start difference. First operand 23724 states and 72991 transitions. Second operand 15 states. [2019-12-18 20:51:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:59,800 INFO L93 Difference]: Finished difference Result 54124 states and 164577 transitions. [2019-12-18 20:51:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 20:51:59,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 20:51:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:59,873 INFO L225 Difference]: With dead ends: 54124 [2019-12-18 20:51:59,873 INFO L226 Difference]: Without dead ends: 51593 [2019-12-18 20:51:59,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=483, Invalid=2709, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 20:52:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51593 states. [2019-12-18 20:52:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51593 to 27150. [2019-12-18 20:52:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27150 states. [2019-12-18 20:52:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27150 states to 27150 states and 83299 transitions. [2019-12-18 20:52:00,431 INFO L78 Accepts]: Start accepts. Automaton has 27150 states and 83299 transitions. Word has length 67 [2019-12-18 20:52:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:00,431 INFO L462 AbstractCegarLoop]: Abstraction has 27150 states and 83299 transitions. [2019-12-18 20:52:00,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 20:52:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 27150 states and 83299 transitions. [2019-12-18 20:52:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:52:00,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:00,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:00,460 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1955892329, now seen corresponding path program 2 times [2019-12-18 20:52:00,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:00,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556105863] [2019-12-18 20:52:00,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:52:00,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556105863] [2019-12-18 20:52:00,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:00,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:52:00,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041103224] [2019-12-18 20:52:00,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:52:00,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:00,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:52:00,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:52:00,654 INFO L87 Difference]: Start difference. First operand 27150 states and 83299 transitions. Second operand 11 states. [2019-12-18 20:52:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:01,847 INFO L93 Difference]: Finished difference Result 59347 states and 181739 transitions. [2019-12-18 20:52:01,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 20:52:01,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:52:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:01,903 INFO L225 Difference]: With dead ends: 59347 [2019-12-18 20:52:01,903 INFO L226 Difference]: Without dead ends: 40072 [2019-12-18 20:52:01,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 20:52:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40072 states. [2019-12-18 20:52:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40072 to 23644. [2019-12-18 20:52:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23644 states. [2019-12-18 20:52:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23644 states to 23644 states and 72057 transitions. [2019-12-18 20:52:02,375 INFO L78 Accepts]: Start accepts. Automaton has 23644 states and 72057 transitions. Word has length 67 [2019-12-18 20:52:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:02,376 INFO L462 AbstractCegarLoop]: Abstraction has 23644 states and 72057 transitions. [2019-12-18 20:52:02,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:52:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23644 states and 72057 transitions. [2019-12-18 20:52:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:52:02,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:02,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:02,401 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:02,401 INFO L82 PathProgramCache]: Analyzing trace with hash -673154253, now seen corresponding path program 3 times [2019-12-18 20:52:02,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:02,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948062985] [2019-12-18 20:52:02,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:52:02,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948062985] [2019-12-18 20:52:02,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:02,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:52:02,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013109525] [2019-12-18 20:52:02,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:52:02,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:52:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:52:02,978 INFO L87 Difference]: Start difference. First operand 23644 states and 72057 transitions. Second operand 16 states. [2019-12-18 20:52:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:07,128 INFO L93 Difference]: Finished difference Result 43383 states and 130623 transitions. [2019-12-18 20:52:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 20:52:07,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 20:52:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:07,189 INFO L225 Difference]: With dead ends: 43383 [2019-12-18 20:52:07,189 INFO L226 Difference]: Without dead ends: 42628 [2019-12-18 20:52:07,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=426, Invalid=2226, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 20:52:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42628 states. [2019-12-18 20:52:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42628 to 23566. [2019-12-18 20:52:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23566 states. [2019-12-18 20:52:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23566 states to 23566 states and 71853 transitions. [2019-12-18 20:52:07,687 INFO L78 Accepts]: Start accepts. Automaton has 23566 states and 71853 transitions. Word has length 67 [2019-12-18 20:52:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:07,688 INFO L462 AbstractCegarLoop]: Abstraction has 23566 states and 71853 transitions. [2019-12-18 20:52:07,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:52:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23566 states and 71853 transitions. [2019-12-18 20:52:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:52:07,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:07,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:07,713 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:07,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1670572367, now seen corresponding path program 4 times [2019-12-18 20:52:07,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:07,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554574150] [2019-12-18 20:52:07,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:52:07,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554574150] [2019-12-18 20:52:07,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:07,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:52:07,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774589952] [2019-12-18 20:52:07,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:52:07,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:52:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:52:07,884 INFO L87 Difference]: Start difference. First operand 23566 states and 71853 transitions. Second operand 12 states. [2019-12-18 20:52:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:08,990 INFO L93 Difference]: Finished difference Result 40372 states and 122485 transitions. [2019-12-18 20:52:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:52:08,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 20:52:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:09,044 INFO L225 Difference]: With dead ends: 40372 [2019-12-18 20:52:09,044 INFO L226 Difference]: Without dead ends: 39448 [2019-12-18 20:52:09,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:52:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39448 states. [2019-12-18 20:52:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39448 to 22982. [2019-12-18 20:52:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22982 states. [2019-12-18 20:52:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22982 states to 22982 states and 70236 transitions. [2019-12-18 20:52:09,496 INFO L78 Accepts]: Start accepts. Automaton has 22982 states and 70236 transitions. Word has length 67 [2019-12-18 20:52:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:09,496 INFO L462 AbstractCegarLoop]: Abstraction has 22982 states and 70236 transitions. [2019-12-18 20:52:09,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:52:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22982 states and 70236 transitions. [2019-12-18 20:52:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:52:09,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:09,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:09,517 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 5 times [2019-12-18 20:52:09,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:09,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171744649] [2019-12-18 20:52:09,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:52:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:52:09,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:52:09,623 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:52:09,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t678~0.base_21|) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= (select .cse0 |v_ULTIMATE.start_main_~#t678~0.base_21|) 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~x~0_10 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$w_buff1_used~0_73) (= v_~y~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t678~0.base_21| 1)) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_ULTIMATE.start_main_~#t678~0.offset_16|) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t678~0.base_21| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_21|) |v_ULTIMATE.start_main_~#t678~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t678~0.offset=|v_ULTIMATE.start_main_~#t678~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_15|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_19|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_20|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ULTIMATE.start_main_~#t678~0.base=|v_ULTIMATE.start_main_~#t678~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t678~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t680~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t680~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t679~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t678~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:52:09,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:52:09,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (not (= |v_ULTIMATE.start_main_~#t679~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11|) |v_ULTIMATE.start_main_~#t679~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t679~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t679~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t679~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t679~0.offset] because there is no mapped edge [2019-12-18 20:52:09,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t680~0.base_12| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12|) |v_ULTIMATE.start_main_~#t680~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t680~0.base_12|) (= |v_ULTIMATE.start_main_~#t680~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t680~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t680~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t680~0.base] because there is no mapped edge [2019-12-18 20:52:09,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out356948822| |P1Thread1of1ForFork2_#t~ite9_Out356948822|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In356948822 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In356948822 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In356948822 |P1Thread1of1ForFork2_#t~ite9_Out356948822|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In356948822 |P1Thread1of1ForFork2_#t~ite9_Out356948822|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In356948822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In356948822, ~z$w_buff1~0=~z$w_buff1~0_In356948822, ~z~0=~z~0_In356948822} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out356948822|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In356948822, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out356948822|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In356948822, ~z$w_buff1~0=~z$w_buff1~0_In356948822, ~z~0=~z~0_In356948822} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:52:09,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1082685591 256)))) (or (and (= ~z$w_buff1~0_In-1082685591 |P2Thread1of1ForFork0_#t~ite24_Out-1082685591|) (= |P2Thread1of1ForFork0_#t~ite23_In-1082685591| |P2Thread1of1ForFork0_#t~ite23_Out-1082685591|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite23_Out-1082685591| ~z$w_buff1~0_In-1082685591) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1082685591 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1082685591 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1082685591 256) 0)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1082685591 256)) .cse1))) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-1082685591| |P2Thread1of1ForFork0_#t~ite24_Out-1082685591|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1082685591, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1082685591, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1082685591|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1082685591, ~z$w_buff1~0=~z$w_buff1~0_In-1082685591, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1082685591, ~weak$$choice2~0=~weak$$choice2~0_In-1082685591} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1082685591, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1082685591|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1082685591, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1082685591|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1082685591, ~z$w_buff1~0=~z$w_buff1~0_In-1082685591, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1082685591, ~weak$$choice2~0=~weak$$choice2~0_In-1082685591} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 20:52:09,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out1008983733| |P2Thread1of1ForFork0_#t~ite30_Out1008983733|)) (.cse4 (= (mod ~weak$$choice2~0_In1008983733 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1008983733 256))) (.cse5 (= 0 (mod ~z$w_buff1_used~0_In1008983733 256))) (.cse6 (= (mod ~z$r_buff0_thd3~0_In1008983733 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1008983733 256)))) (or (let ((.cse1 (not .cse6))) (and (= |P2Thread1of1ForFork0_#t~ite29_Out1008983733| |P2Thread1of1ForFork0_#t~ite28_Out1008983733|) (or (not .cse0) .cse1) .cse2 (not .cse3) .cse4 (= 0 |P2Thread1of1ForFork0_#t~ite28_Out1008983733|) (or (not .cse5) .cse1))) (and (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out1008983733| |P2Thread1of1ForFork0_#t~ite29_In1008983733|) (not .cse4) (= ~z$w_buff1_used~0_In1008983733 |P2Thread1of1ForFork0_#t~ite30_Out1008983733|)) (and .cse2 .cse4 (= |P2Thread1of1ForFork0_#t~ite29_Out1008983733| ~z$w_buff1_used~0_In1008983733) (or (and .cse0 .cse6) (and .cse5 .cse6) .cse3))) (= |P2Thread1of1ForFork0_#t~ite28_In1008983733| |P2Thread1of1ForFork0_#t~ite28_Out1008983733|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1008983733|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1008983733, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1008983733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1008983733, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1008983733, ~weak$$choice2~0=~weak$$choice2~0_In1008983733, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1008983733|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1008983733|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1008983733, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1008983733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1008983733, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1008983733, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1008983733|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1008983733|, ~weak$$choice2~0=~weak$$choice2~0_In1008983733} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:52:09,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:52:09,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 20:52:09,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out1351494881| |P2Thread1of1ForFork0_#t~ite38_Out1351494881|)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1351494881 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1351494881 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In1351494881 |P2Thread1of1ForFork0_#t~ite38_Out1351494881|)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In1351494881 |P2Thread1of1ForFork0_#t~ite38_Out1351494881|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1351494881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1351494881, ~z$w_buff1~0=~z$w_buff1~0_In1351494881, ~z~0=~z~0_In1351494881} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1351494881|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1351494881|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1351494881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1351494881, ~z$w_buff1~0=~z$w_buff1~0_In1351494881, ~z~0=~z~0_In1351494881} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:52:09,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1297609209 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1297609209 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1297609209| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1297609209 |P2Thread1of1ForFork0_#t~ite40_Out1297609209|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1297609209, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1297609209} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1297609209, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1297609209|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1297609209} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:52:09,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-869146186 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-869146186 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-869146186 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-869146186 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-869146186| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-869146186| ~z$w_buff1_used~0_In-869146186) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-869146186, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-869146186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-869146186, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-869146186} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-869146186, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-869146186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-869146186, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-869146186, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-869146186|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:52:09,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1197839756 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1197839756 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1197839756| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1197839756| ~z$r_buff0_thd3~0_In1197839756) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1197839756, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1197839756} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1197839756, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1197839756, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1197839756|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:52:09,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1802393852 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1802393852 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1802393852 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1802393852 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1802393852| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out-1802393852| ~z$r_buff1_thd3~0_In-1802393852) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1802393852, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1802393852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1802393852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1802393852} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1802393852|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1802393852, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1802393852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1802393852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1802393852} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:52:09,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:52:09,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In947379975 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In947379975 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In947379975 |P0Thread1of1ForFork1_#t~ite5_Out947379975|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out947379975|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In947379975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In947379975} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out947379975|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In947379975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In947379975} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:52:09,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-781630561 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-781630561 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-781630561 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-781630561 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-781630561 |P0Thread1of1ForFork1_#t~ite6_Out-781630561|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-781630561|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-781630561, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-781630561, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-781630561, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-781630561} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-781630561, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-781630561|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-781630561, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-781630561, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-781630561} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:52:09,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-137159647 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-137159647 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out-137159647 ~z$r_buff0_thd1~0_In-137159647) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out-137159647 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-137159647, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-137159647} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-137159647, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-137159647|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-137159647} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:52:09,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1925375327 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1925375327 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1925375327 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1925375327 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1925375327|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In-1925375327 |P0Thread1of1ForFork1_#t~ite8_Out-1925375327|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1925375327, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1925375327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1925375327, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1925375327} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1925375327|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1925375327, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1925375327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1925375327, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1925375327} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:52:09,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:52:09,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2141528988 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2141528988 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-2141528988|)) (and (= ~z$w_buff0_used~0_In-2141528988 |P1Thread1of1ForFork2_#t~ite11_Out-2141528988|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141528988, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2141528988} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141528988, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-2141528988|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2141528988} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:52:09,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-178436303 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-178436303 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-178436303 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-178436303 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-178436303 |P1Thread1of1ForFork2_#t~ite12_Out-178436303|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-178436303| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-178436303, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-178436303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-178436303, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-178436303} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-178436303, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-178436303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-178436303, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-178436303|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-178436303} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:52:09,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1839978182 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1839978182 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-1839978182 |P1Thread1of1ForFork2_#t~ite13_Out-1839978182|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1839978182|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839978182, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1839978182} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839978182, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1839978182|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1839978182} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:52:09,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1276435502 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1276435502 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1276435502 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1276435502 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1276435502 |P1Thread1of1ForFork2_#t~ite14_Out1276435502|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1276435502|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1276435502, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1276435502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1276435502, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1276435502} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1276435502, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1276435502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1276435502, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1276435502|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1276435502} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:52:09,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:52:09,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:52:09,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-130040158 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-130040158 256)))) (or (and (= ~z~0_In-130040158 |ULTIMATE.start_main_#t~ite47_Out-130040158|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-130040158 |ULTIMATE.start_main_#t~ite47_Out-130040158|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-130040158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-130040158, ~z$w_buff1~0=~z$w_buff1~0_In-130040158, ~z~0=~z~0_In-130040158} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-130040158, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-130040158|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-130040158, ~z$w_buff1~0=~z$w_buff1~0_In-130040158, ~z~0=~z~0_In-130040158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:52:09,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 20:52:09,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1409184514 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1409184514 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1409184514| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1409184514| ~z$w_buff0_used~0_In1409184514)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1409184514, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1409184514} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1409184514, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1409184514, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1409184514|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:52:09,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1327075314 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1327075314 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1327075314 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1327075314 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1327075314|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1327075314 |ULTIMATE.start_main_#t~ite50_Out1327075314|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1327075314, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1327075314, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1327075314, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1327075314} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1327075314|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1327075314, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1327075314, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1327075314, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1327075314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:52:09,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In503168829 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In503168829 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out503168829| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In503168829 |ULTIMATE.start_main_#t~ite51_Out503168829|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In503168829, ~z$w_buff0_used~0=~z$w_buff0_used~0_In503168829} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In503168829, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out503168829|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In503168829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:52:09,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-390337240 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-390337240 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-390337240 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-390337240 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-390337240| ~z$r_buff1_thd0~0_In-390337240) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-390337240| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-390337240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-390337240, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-390337240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390337240} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-390337240|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-390337240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-390337240, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-390337240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390337240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:52:09,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_7 2) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= 2 v_~y~0_8) (= v_~main$tmp_guard1~0_6 0) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:52:09,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:52:09 BasicIcfg [2019-12-18 20:52:09,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:52:09,755 INFO L168 Benchmark]: Toolchain (without parser) took 117220.29 ms. Allocated memory was 135.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 96.8 MB in the beginning and 935.9 MB in the end (delta: -839.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:52:09,755 INFO L168 Benchmark]: CDTParser took 1.64 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:52:09,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.51 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 96.6 MB in the beginning and 152.8 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:52:09,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.83 ms. Allocated memory is still 199.8 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:52:09,757 INFO L168 Benchmark]: Boogie Preprocessor took 37.89 ms. Allocated memory is still 199.8 MB. Free memory was 150.1 MB in the beginning and 148.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:52:09,758 INFO L168 Benchmark]: RCFGBuilder took 805.31 ms. Allocated memory is still 199.8 MB. Free memory was 148.0 MB in the beginning and 97.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:52:09,758 INFO L168 Benchmark]: TraceAbstraction took 115475.43 ms. Allocated memory was 199.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 97.5 MB in the beginning and 935.9 MB in the end (delta: -838.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 20:52:09,761 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.64 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.51 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 96.6 MB in the beginning and 152.8 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.83 ms. Allocated memory is still 199.8 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.89 ms. Allocated memory is still 199.8 MB. Free memory was 150.1 MB in the beginning and 148.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 805.31 ms. Allocated memory is still 199.8 MB. Free memory was 148.0 MB in the beginning and 97.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115475.43 ms. Allocated memory was 199.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 97.5 MB in the beginning and 935.9 MB in the end (delta: -838.4 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: 3.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6462 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t678, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t679, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t680, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 115.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 39.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7326 SDtfs, 9033 SDslu, 27212 SDs, 0 SdLazy, 18751 SolverSat, 395 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 35 SyntacticMatches, 37 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred 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: 46.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 303442 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1267 NumberOfCodeBlocks, 1267 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1171 ConstructedInterpolants, 0 QuantifiedInterpolants, 287601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...