/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/mix027_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:01:24,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:01:24,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:01:24,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:01:24,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:01:24,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:01:24,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:01:24,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:01:24,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:01:24,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:01:24,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:01:24,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:01:24,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:01:24,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:01:24,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:01:24,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:01:24,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:01:24,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:01:24,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:01:24,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:01:24,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:01:24,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:01:24,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:01:24,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:01:24,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:01:24,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:01:24,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:01:24,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:01:24,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:01:24,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:01:24,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:01:24,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:01:24,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:01:24,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:01:24,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:01:24,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:01:24,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:01:24,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:01:24,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:01:24,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:01:24,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:01:24,415 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-27 06:01:24,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:01:24,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:01:24,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:01:24,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:01:24,431 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:01:24,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:01:24,431 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:01:24,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:01:24,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:01:24,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:01:24,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:01:24,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:01:24,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:01:24,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:01:24,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:01:24,433 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:01:24,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:01:24,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:01:24,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:01:24,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:01:24,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:01:24,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:01:24,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:01:24,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:01:24,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:01:24,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:01:24,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:01:24,435 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:01:24,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:01:24,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:01:24,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:01:24,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:01:24,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:01:24,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:01:24,720 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:01:24,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2019-12-27 06:01:24,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee37d7bac/8722aee1479348b2915cc77439232da8/FLAG99d492035 [2019-12-27 06:01:25,388 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:01:25,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2019-12-27 06:01:25,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee37d7bac/8722aee1479348b2915cc77439232da8/FLAG99d492035 [2019-12-27 06:01:25,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee37d7bac/8722aee1479348b2915cc77439232da8 [2019-12-27 06:01:25,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:01:25,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:01:25,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:01:25,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:01:25,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:01:25,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:01:25" (1/1) ... [2019-12-27 06:01:25,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a22c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:25, skipping insertion in model container [2019-12-27 06:01:25,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:01:25" (1/1) ... [2019-12-27 06:01:25,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:01:25,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:01:26,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:01:26,324 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:01:26,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:01:26,487 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:01:26,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26 WrapperNode [2019-12-27 06:01:26,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:01:26,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:01:26,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:01:26,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:01:26,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:01:26,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:01:26,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:01:26,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:01:26,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... [2019-12-27 06:01:26,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:01:26,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:01:26,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:01:26,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:01:26,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:01:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:01:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:01:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:01:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:01:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:01:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:01:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:01:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:01:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:01:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:01:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:01:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:01:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:01:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:01:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:01:26,680 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:01:27,425 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:01:27,425 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:01:27,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:01:27 BoogieIcfgContainer [2019-12-27 06:01:27,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:01:27,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:01:27,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:01:27,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:01:27,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:01:25" (1/3) ... [2019-12-27 06:01:27,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@941aec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:01:27, skipping insertion in model container [2019-12-27 06:01:27,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:01:26" (2/3) ... [2019-12-27 06:01:27,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@941aec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:01:27, skipping insertion in model container [2019-12-27 06:01:27,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:01:27" (3/3) ... [2019-12-27 06:01:27,438 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_rmo.opt.i [2019-12-27 06:01:27,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:01:27,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:01:27,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:01:27,463 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:01:27,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,562 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,568 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,568 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,578 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,579 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,582 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,582 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:01:27,609 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:01:27,630 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:01:27,630 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:01:27,630 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:01:27,630 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:01:27,631 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:01:27,631 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:01:27,631 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:01:27,631 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:01:27,648 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 06:01:27,651 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 06:01:27,754 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 06:01:27,755 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:01:27,773 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:01:27,798 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 06:01:27,854 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 06:01:27,854 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:01:27,867 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:01:27,891 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 06:01:27,892 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:01:31,683 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 06:01:31,838 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 06:01:31,861 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78681 [2019-12-27 06:01:31,861 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 06:01:31,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 06:02:19,477 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 188550 states. [2019-12-27 06:02:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 188550 states. [2019-12-27 06:02:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:02:19,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:02:19,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:02:19,486 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:02:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:02:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1081112205, now seen corresponding path program 1 times [2019-12-27 06:02:19,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:02:19,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181339232] [2019-12-27 06:02:19,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:02:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:02:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:02:19,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181339232] [2019-12-27 06:02:19,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:02:19,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:02:19,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732617242] [2019-12-27 06:02:19,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:02:19,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:02:19,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:02:19,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:02:19,766 INFO L87 Difference]: Start difference. First operand 188550 states. Second operand 3 states. [2019-12-27 06:02:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:02:23,968 INFO L93 Difference]: Finished difference Result 175078 states and 839564 transitions. [2019-12-27 06:02:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:02:23,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:02:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:02:24,917 INFO L225 Difference]: With dead ends: 175078 [2019-12-27 06:02:24,918 INFO L226 Difference]: Without dead ends: 164262 [2019-12-27 06:02:24,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:02:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164262 states. [2019-12-27 06:02:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164262 to 164262. [2019-12-27 06:02:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164262 states. [2019-12-27 06:02:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164262 states to 164262 states and 786680 transitions. [2019-12-27 06:02:46,233 INFO L78 Accepts]: Start accepts. Automaton has 164262 states and 786680 transitions. Word has length 7 [2019-12-27 06:02:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:02:46,234 INFO L462 AbstractCegarLoop]: Abstraction has 164262 states and 786680 transitions. [2019-12-27 06:02:46,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:02:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 164262 states and 786680 transitions. [2019-12-27 06:02:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:02:46,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:02:46,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:02:46,247 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:02:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:02:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash -983624590, now seen corresponding path program 1 times [2019-12-27 06:02:46,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:02:46,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149073482] [2019-12-27 06:02:46,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:02:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:02:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:02:46,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149073482] [2019-12-27 06:02:46,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:02:46,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:02:46,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751106588] [2019-12-27 06:02:46,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:02:46,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:02:46,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:02:46,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:02:46,398 INFO L87 Difference]: Start difference. First operand 164262 states and 786680 transitions. Second operand 4 states. [2019-12-27 06:02:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:02:49,733 INFO L93 Difference]: Finished difference Result 260206 states and 1199142 transitions. [2019-12-27 06:02:49,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:02:49,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:02:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:02:50,730 INFO L225 Difference]: With dead ends: 260206 [2019-12-27 06:02:50,730 INFO L226 Difference]: Without dead ends: 259982 [2019-12-27 06:02:50,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:03:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259982 states. [2019-12-27 06:03:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259982 to 241474. [2019-12-27 06:03:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241474 states. [2019-12-27 06:03:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241474 states to 241474 states and 1122210 transitions. [2019-12-27 06:03:23,100 INFO L78 Accepts]: Start accepts. Automaton has 241474 states and 1122210 transitions. Word has length 15 [2019-12-27 06:03:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:03:23,100 INFO L462 AbstractCegarLoop]: Abstraction has 241474 states and 1122210 transitions. [2019-12-27 06:03:23,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:03:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 241474 states and 1122210 transitions. [2019-12-27 06:03:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:03:23,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:03:23,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:03:23,106 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:03:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:03:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1733643067, now seen corresponding path program 1 times [2019-12-27 06:03:23,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:03:23,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028614814] [2019-12-27 06:03:23,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:03:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:03:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:03:23,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028614814] [2019-12-27 06:03:23,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:03:23,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:03:23,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435038358] [2019-12-27 06:03:23,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:03:23,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:03:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:03:23,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:03:23,188 INFO L87 Difference]: Start difference. First operand 241474 states and 1122210 transitions. Second operand 3 states. [2019-12-27 06:03:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:03:23,986 INFO L93 Difference]: Finished difference Result 150344 states and 629507 transitions. [2019-12-27 06:03:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:03:23,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:03:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:03:26,609 INFO L225 Difference]: With dead ends: 150344 [2019-12-27 06:03:26,609 INFO L226 Difference]: Without dead ends: 150344 [2019-12-27 06:03:26,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:03:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150344 states. [2019-12-27 06:03:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150344 to 150344. [2019-12-27 06:03:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150344 states. [2019-12-27 06:03:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150344 states to 150344 states and 629507 transitions. [2019-12-27 06:03:44,824 INFO L78 Accepts]: Start accepts. Automaton has 150344 states and 629507 transitions. Word has length 15 [2019-12-27 06:03:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:03:44,824 INFO L462 AbstractCegarLoop]: Abstraction has 150344 states and 629507 transitions. [2019-12-27 06:03:44,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:03:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 150344 states and 629507 transitions. [2019-12-27 06:03:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:03:44,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:03:44,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:03:44,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:03:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:03:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash 763013226, now seen corresponding path program 1 times [2019-12-27 06:03:44,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:03:44,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114038279] [2019-12-27 06:03:44,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:03:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:03:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:03:44,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114038279] [2019-12-27 06:03:44,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:03:44,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:03:44,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104636702] [2019-12-27 06:03:44,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:03:44,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:03:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:03:44,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:03:44,915 INFO L87 Difference]: Start difference. First operand 150344 states and 629507 transitions. Second operand 4 states. [2019-12-27 06:03:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:03:45,122 INFO L93 Difference]: Finished difference Result 41318 states and 147207 transitions. [2019-12-27 06:03:45,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:03:45,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:03:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:03:45,218 INFO L225 Difference]: With dead ends: 41318 [2019-12-27 06:03:45,219 INFO L226 Difference]: Without dead ends: 41318 [2019-12-27 06:03:45,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:03:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41318 states. [2019-12-27 06:03:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41318 to 41318. [2019-12-27 06:03:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41318 states. [2019-12-27 06:03:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41318 states to 41318 states and 147207 transitions. [2019-12-27 06:03:46,699 INFO L78 Accepts]: Start accepts. Automaton has 41318 states and 147207 transitions. Word has length 16 [2019-12-27 06:03:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:03:46,699 INFO L462 AbstractCegarLoop]: Abstraction has 41318 states and 147207 transitions. [2019-12-27 06:03:46,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:03:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 41318 states and 147207 transitions. [2019-12-27 06:03:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:03:46,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:03:46,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:03:46,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:03:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:03:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash -613707051, now seen corresponding path program 1 times [2019-12-27 06:03:46,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:03:46,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201454127] [2019-12-27 06:03:46,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:03:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:03:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:03:46,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201454127] [2019-12-27 06:03:46,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:03:46,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:03:46,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274359411] [2019-12-27 06:03:46,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:03:46,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:03:46,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:03:46,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:03:46,817 INFO L87 Difference]: Start difference. First operand 41318 states and 147207 transitions. Second operand 5 states. [2019-12-27 06:03:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:03:47,397 INFO L93 Difference]: Finished difference Result 59208 states and 207429 transitions. [2019-12-27 06:03:47,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:03:47,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:03:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:03:47,519 INFO L225 Difference]: With dead ends: 59208 [2019-12-27 06:03:47,520 INFO L226 Difference]: Without dead ends: 59190 [2019-12-27 06:03:47,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:03:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59190 states. [2019-12-27 06:03:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59190 to 47448. [2019-12-27 06:03:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47448 states. [2019-12-27 06:03:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47448 states to 47448 states and 168412 transitions. [2019-12-27 06:03:51,328 INFO L78 Accepts]: Start accepts. Automaton has 47448 states and 168412 transitions. Word has length 16 [2019-12-27 06:03:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:03:51,328 INFO L462 AbstractCegarLoop]: Abstraction has 47448 states and 168412 transitions. [2019-12-27 06:03:51,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:03:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 47448 states and 168412 transitions. [2019-12-27 06:03:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:03:51,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:03:51,348 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] [2019-12-27 06:03:51,349 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:03:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:03:51,349 INFO L82 PathProgramCache]: Analyzing trace with hash -671023088, now seen corresponding path program 1 times [2019-12-27 06:03:51,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:03:51,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177561598] [2019-12-27 06:03:51,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:03:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:03:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:03:51,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177561598] [2019-12-27 06:03:51,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:03:51,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:03:51,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598725020] [2019-12-27 06:03:51,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:03:51,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:03:51,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:03:51,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:03:51,517 INFO L87 Difference]: Start difference. First operand 47448 states and 168412 transitions. Second operand 6 states. [2019-12-27 06:03:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:03:52,457 INFO L93 Difference]: Finished difference Result 74089 states and 256860 transitions. [2019-12-27 06:03:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:03:52,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 06:03:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:03:52,601 INFO L225 Difference]: With dead ends: 74089 [2019-12-27 06:03:52,601 INFO L226 Difference]: Without dead ends: 74059 [2019-12-27 06:03:52,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:03:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74059 states. [2019-12-27 06:03:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74059 to 51590. [2019-12-27 06:03:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51590 states. [2019-12-27 06:03:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51590 states to 51590 states and 182170 transitions. [2019-12-27 06:03:54,216 INFO L78 Accepts]: Start accepts. Automaton has 51590 states and 182170 transitions. Word has length 24 [2019-12-27 06:03:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:03:54,216 INFO L462 AbstractCegarLoop]: Abstraction has 51590 states and 182170 transitions. [2019-12-27 06:03:54,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:03:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 51590 states and 182170 transitions. [2019-12-27 06:03:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:03:54,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:03:54,232 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] [2019-12-27 06:03:54,232 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:03:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:03:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1890536022, now seen corresponding path program 2 times [2019-12-27 06:03:54,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:03:54,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27607128] [2019-12-27 06:03:54,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:03:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:03:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:03:54,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27607128] [2019-12-27 06:03:54,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:03:54,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:03:54,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499177713] [2019-12-27 06:03:54,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:03:54,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:03:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:03:54,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:03:54,346 INFO L87 Difference]: Start difference. First operand 51590 states and 182170 transitions. Second operand 6 states. [2019-12-27 06:03:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:03:56,036 INFO L93 Difference]: Finished difference Result 74803 states and 257982 transitions. [2019-12-27 06:03:56,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:03:56,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 06:03:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:03:56,186 INFO L225 Difference]: With dead ends: 74803 [2019-12-27 06:03:56,187 INFO L226 Difference]: Without dead ends: 74773 [2019-12-27 06:03:56,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:03:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74773 states. [2019-12-27 06:03:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74773 to 49188. [2019-12-27 06:03:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49188 states. [2019-12-27 06:03:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49188 states to 49188 states and 173259 transitions. [2019-12-27 06:03:57,302 INFO L78 Accepts]: Start accepts. Automaton has 49188 states and 173259 transitions. Word has length 24 [2019-12-27 06:03:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:03:57,302 INFO L462 AbstractCegarLoop]: Abstraction has 49188 states and 173259 transitions. [2019-12-27 06:03:57,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:03:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 49188 states and 173259 transitions. [2019-12-27 06:03:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:03:57,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:03:57,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:03:57,330 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:03:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:03:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash -477366327, now seen corresponding path program 1 times [2019-12-27 06:03:57,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:03:57,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324207359] [2019-12-27 06:03:57,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:03:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:03:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:03:57,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324207359] [2019-12-27 06:03:57,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:03:57,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:03:57,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091205326] [2019-12-27 06:03:57,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:03:57,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:03:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:03:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:03:57,395 INFO L87 Difference]: Start difference. First operand 49188 states and 173259 transitions. Second operand 5 states. [2019-12-27 06:03:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:03:57,790 INFO L93 Difference]: Finished difference Result 26846 states and 95897 transitions. [2019-12-27 06:03:57,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:03:57,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:03:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:03:57,841 INFO L225 Difference]: With dead ends: 26846 [2019-12-27 06:03:57,842 INFO L226 Difference]: Without dead ends: 26846 [2019-12-27 06:03:57,842 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-27 06:03:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26846 states. [2019-12-27 06:03:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26846 to 26446. [2019-12-27 06:03:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26446 states. [2019-12-27 06:03:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26446 states to 26446 states and 94537 transitions. [2019-12-27 06:03:58,325 INFO L78 Accepts]: Start accepts. Automaton has 26446 states and 94537 transitions. Word has length 28 [2019-12-27 06:03:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:03:58,325 INFO L462 AbstractCegarLoop]: Abstraction has 26446 states and 94537 transitions. [2019-12-27 06:03:58,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:03:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 26446 states and 94537 transitions. [2019-12-27 06:03:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 06:03:58,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:03:58,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:03:58,370 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:03:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:03:58,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1943183858, now seen corresponding path program 1 times [2019-12-27 06:03:58,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:03:58,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054548024] [2019-12-27 06:03:58,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:03:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:03:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:03:58,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054548024] [2019-12-27 06:03:58,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:03:58,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:03:58,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772488513] [2019-12-27 06:03:58,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:03:58,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:03:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:03:58,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:03:58,440 INFO L87 Difference]: Start difference. First operand 26446 states and 94537 transitions. Second operand 3 states. [2019-12-27 06:03:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:03:58,658 INFO L93 Difference]: Finished difference Result 39888 states and 135979 transitions. [2019-12-27 06:03:58,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:03:58,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 06:03:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:03:58,725 INFO L225 Difference]: With dead ends: 39888 [2019-12-27 06:03:58,725 INFO L226 Difference]: Without dead ends: 26945 [2019-12-27 06:03:58,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:03:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26945 states. [2019-12-27 06:03:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26945 to 26508. [2019-12-27 06:03:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26508 states. [2019-12-27 06:03:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26508 states to 26508 states and 82548 transitions. [2019-12-27 06:03:59,198 INFO L78 Accepts]: Start accepts. Automaton has 26508 states and 82548 transitions. Word has length 42 [2019-12-27 06:03:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:03:59,198 INFO L462 AbstractCegarLoop]: Abstraction has 26508 states and 82548 transitions. [2019-12-27 06:03:59,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:03:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 26508 states and 82548 transitions. [2019-12-27 06:03:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 06:03:59,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:03:59,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:03:59,495 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:03:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:03:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash -842084234, now seen corresponding path program 1 times [2019-12-27 06:03:59,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:03:59,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176789031] [2019-12-27 06:03:59,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:03:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:03:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:03:59,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176789031] [2019-12-27 06:03:59,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:03:59,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:03:59,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989951984] [2019-12-27 06:03:59,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:03:59,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:03:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:03:59,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:03:59,623 INFO L87 Difference]: Start difference. First operand 26508 states and 82548 transitions. Second operand 6 states. [2019-12-27 06:03:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:03:59,806 INFO L93 Difference]: Finished difference Result 25159 states and 79138 transitions. [2019-12-27 06:03:59,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:03:59,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 06:03:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:03:59,834 INFO L225 Difference]: With dead ends: 25159 [2019-12-27 06:03:59,834 INFO L226 Difference]: Without dead ends: 12897 [2019-12-27 06:03:59,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:03:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2019-12-27 06:04:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 12484. [2019-12-27 06:04:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12484 states. [2019-12-27 06:04:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12484 states to 12484 states and 39095 transitions. [2019-12-27 06:04:00,142 INFO L78 Accepts]: Start accepts. Automaton has 12484 states and 39095 transitions. Word has length 43 [2019-12-27 06:04:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:00,144 INFO L462 AbstractCegarLoop]: Abstraction has 12484 states and 39095 transitions. [2019-12-27 06:04:00,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:04:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 12484 states and 39095 transitions. [2019-12-27 06:04:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:04:00,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:00,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:00,169 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1618282670, now seen corresponding path program 1 times [2019-12-27 06:04:00,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:00,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204790730] [2019-12-27 06:04:00,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:00,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204790730] [2019-12-27 06:04:00,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:00,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:04:00,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707675866] [2019-12-27 06:04:00,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:04:00,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:00,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:04:00,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:00,302 INFO L87 Difference]: Start difference. First operand 12484 states and 39095 transitions. Second operand 3 states. [2019-12-27 06:04:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:00,413 INFO L93 Difference]: Finished difference Result 16821 states and 51803 transitions. [2019-12-27 06:04:00,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:04:00,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 06:04:00,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:00,442 INFO L225 Difference]: With dead ends: 16821 [2019-12-27 06:04:00,442 INFO L226 Difference]: Without dead ends: 16821 [2019-12-27 06:04:00,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16821 states. [2019-12-27 06:04:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16821 to 13740. [2019-12-27 06:04:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2019-12-27 06:04:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 42926 transitions. [2019-12-27 06:04:00,749 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 42926 transitions. Word has length 57 [2019-12-27 06:04:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:00,749 INFO L462 AbstractCegarLoop]: Abstraction has 13740 states and 42926 transitions. [2019-12-27 06:04:00,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:04:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 42926 transitions. [2019-12-27 06:04:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:04:00,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:00,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:00,767 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash 387764161, now seen corresponding path program 1 times [2019-12-27 06:04:00,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:00,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494916421] [2019-12-27 06:04:00,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:00,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494916421] [2019-12-27 06:04:00,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:00,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:04:00,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233086149] [2019-12-27 06:04:00,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:04:00,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:04:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:04:00,836 INFO L87 Difference]: Start difference. First operand 13740 states and 42926 transitions. Second operand 4 states. [2019-12-27 06:04:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:00,945 INFO L93 Difference]: Finished difference Result 24889 states and 77727 transitions. [2019-12-27 06:04:00,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:04:00,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 06:04:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:00,969 INFO L225 Difference]: With dead ends: 24889 [2019-12-27 06:04:00,969 INFO L226 Difference]: Without dead ends: 11471 [2019-12-27 06:04:00,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:04:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2019-12-27 06:04:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 11471. [2019-12-27 06:04:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11471 states. [2019-12-27 06:04:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11471 states to 11471 states and 35689 transitions. [2019-12-27 06:04:01,216 INFO L78 Accepts]: Start accepts. Automaton has 11471 states and 35689 transitions. Word has length 57 [2019-12-27 06:04:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:01,216 INFO L462 AbstractCegarLoop]: Abstraction has 11471 states and 35689 transitions. [2019-12-27 06:04:01,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:04:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 11471 states and 35689 transitions. [2019-12-27 06:04:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:04:01,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:01,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:01,234 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:01,234 INFO L82 PathProgramCache]: Analyzing trace with hash 952511363, now seen corresponding path program 2 times [2019-12-27 06:04:01,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:01,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095777970] [2019-12-27 06:04:01,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:01,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095777970] [2019-12-27 06:04:01,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:01,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:04:01,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580041538] [2019-12-27 06:04:01,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:04:01,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:04:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:04:01,364 INFO L87 Difference]: Start difference. First operand 11471 states and 35689 transitions. Second operand 7 states. [2019-12-27 06:04:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:01,781 INFO L93 Difference]: Finished difference Result 31961 states and 99026 transitions. [2019-12-27 06:04:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:04:01,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:04:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:01,820 INFO L225 Difference]: With dead ends: 31961 [2019-12-27 06:04:01,821 INFO L226 Difference]: Without dead ends: 25025 [2019-12-27 06:04:01,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:04:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2019-12-27 06:04:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 14643. [2019-12-27 06:04:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14643 states. [2019-12-27 06:04:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14643 states to 14643 states and 45925 transitions. [2019-12-27 06:04:02,275 INFO L78 Accepts]: Start accepts. Automaton has 14643 states and 45925 transitions. Word has length 57 [2019-12-27 06:04:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:02,275 INFO L462 AbstractCegarLoop]: Abstraction has 14643 states and 45925 transitions. [2019-12-27 06:04:02,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:04:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 14643 states and 45925 transitions. [2019-12-27 06:04:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:04:02,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:02,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:02,294 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:02,294 INFO L82 PathProgramCache]: Analyzing trace with hash -892256369, now seen corresponding path program 3 times [2019-12-27 06:04:02,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:02,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716789316] [2019-12-27 06:04:02,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:02,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716789316] [2019-12-27 06:04:02,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:02,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:04:02,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061704627] [2019-12-27 06:04:02,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:04:02,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:04:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:04:02,378 INFO L87 Difference]: Start difference. First operand 14643 states and 45925 transitions. Second operand 6 states. [2019-12-27 06:04:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:02,766 INFO L93 Difference]: Finished difference Result 37703 states and 115325 transitions. [2019-12-27 06:04:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:04:02,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 06:04:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:02,818 INFO L225 Difference]: With dead ends: 37703 [2019-12-27 06:04:02,818 INFO L226 Difference]: Without dead ends: 27294 [2019-12-27 06:04:02,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:04:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27294 states. [2019-12-27 06:04:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27294 to 17260. [2019-12-27 06:04:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17260 states. [2019-12-27 06:04:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17260 states to 17260 states and 54084 transitions. [2019-12-27 06:04:03,208 INFO L78 Accepts]: Start accepts. Automaton has 17260 states and 54084 transitions. Word has length 57 [2019-12-27 06:04:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:03,208 INFO L462 AbstractCegarLoop]: Abstraction has 17260 states and 54084 transitions. [2019-12-27 06:04:03,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:04:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17260 states and 54084 transitions. [2019-12-27 06:04:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:04:03,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:03,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:03,226 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:03,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2087351501, now seen corresponding path program 4 times [2019-12-27 06:04:03,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:03,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440076256] [2019-12-27 06:04:03,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:03,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440076256] [2019-12-27 06:04:03,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:03,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:04:03,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772904315] [2019-12-27 06:04:03,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:04:03,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:04:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:04:03,309 INFO L87 Difference]: Start difference. First operand 17260 states and 54084 transitions. Second operand 7 states. [2019-12-27 06:04:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:03,698 INFO L93 Difference]: Finished difference Result 30486 states and 92723 transitions. [2019-12-27 06:04:03,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:04:03,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:04:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:03,744 INFO L225 Difference]: With dead ends: 30486 [2019-12-27 06:04:03,744 INFO L226 Difference]: Without dead ends: 28427 [2019-12-27 06:04:03,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:04:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28427 states. [2019-12-27 06:04:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28427 to 17324. [2019-12-27 06:04:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17324 states. [2019-12-27 06:04:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17324 states to 17324 states and 54315 transitions. [2019-12-27 06:04:04,239 INFO L78 Accepts]: Start accepts. Automaton has 17324 states and 54315 transitions. Word has length 57 [2019-12-27 06:04:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:04,239 INFO L462 AbstractCegarLoop]: Abstraction has 17324 states and 54315 transitions. [2019-12-27 06:04:04,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:04:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 17324 states and 54315 transitions. [2019-12-27 06:04:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:04:04,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:04,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:04,258 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1340364786, now seen corresponding path program 1 times [2019-12-27 06:04:04,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:04,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975213913] [2019-12-27 06:04:04,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:04,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975213913] [2019-12-27 06:04:04,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:04,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:04:04,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249551258] [2019-12-27 06:04:04,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:04:04,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:04:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:04,303 INFO L87 Difference]: Start difference. First operand 17324 states and 54315 transitions. Second operand 3 states. [2019-12-27 06:04:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:04,391 INFO L93 Difference]: Finished difference Result 19127 states and 58227 transitions. [2019-12-27 06:04:04,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:04:04,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 06:04:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:04,417 INFO L225 Difference]: With dead ends: 19127 [2019-12-27 06:04:04,417 INFO L226 Difference]: Without dead ends: 19127 [2019-12-27 06:04:04,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19127 states. [2019-12-27 06:04:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19127 to 17324. [2019-12-27 06:04:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17324 states. [2019-12-27 06:04:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17324 states to 17324 states and 53125 transitions. [2019-12-27 06:04:04,696 INFO L78 Accepts]: Start accepts. Automaton has 17324 states and 53125 transitions. Word has length 57 [2019-12-27 06:04:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:04,696 INFO L462 AbstractCegarLoop]: Abstraction has 17324 states and 53125 transitions. [2019-12-27 06:04:04,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:04:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17324 states and 53125 transitions. [2019-12-27 06:04:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:04:04,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:04,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:04,714 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1476889779, now seen corresponding path program 5 times [2019-12-27 06:04:04,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:04,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355259908] [2019-12-27 06:04:04,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:04,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355259908] [2019-12-27 06:04:04,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:04,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:04:04,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206501540] [2019-12-27 06:04:04,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:04:04,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:04,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:04:04,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:04:04,797 INFO L87 Difference]: Start difference. First operand 17324 states and 53125 transitions. Second operand 7 states. [2019-12-27 06:04:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:05,184 INFO L93 Difference]: Finished difference Result 33840 states and 100860 transitions. [2019-12-27 06:04:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:04:05,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:04:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:05,238 INFO L225 Difference]: With dead ends: 33840 [2019-12-27 06:04:05,238 INFO L226 Difference]: Without dead ends: 28566 [2019-12-27 06:04:05,239 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-27 06:04:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28566 states. [2019-12-27 06:04:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28566 to 17534. [2019-12-27 06:04:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17534 states. [2019-12-27 06:04:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17534 states to 17534 states and 53712 transitions. [2019-12-27 06:04:05,600 INFO L78 Accepts]: Start accepts. Automaton has 17534 states and 53712 transitions. Word has length 57 [2019-12-27 06:04:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:05,600 INFO L462 AbstractCegarLoop]: Abstraction has 17534 states and 53712 transitions. [2019-12-27 06:04:05,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:04:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 17534 states and 53712 transitions. [2019-12-27 06:04:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:04:05,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:05,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:05,620 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:05,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2138440037, now seen corresponding path program 6 times [2019-12-27 06:04:05,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:05,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600194914] [2019-12-27 06:04:05,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:05,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600194914] [2019-12-27 06:04:05,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:05,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:04:05,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102129425] [2019-12-27 06:04:05,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:04:05,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:04:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:05,692 INFO L87 Difference]: Start difference. First operand 17534 states and 53712 transitions. Second operand 3 states. [2019-12-27 06:04:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:05,767 INFO L93 Difference]: Finished difference Result 14530 states and 43522 transitions. [2019-12-27 06:04:05,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:04:05,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 06:04:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:05,794 INFO L225 Difference]: With dead ends: 14530 [2019-12-27 06:04:05,794 INFO L226 Difference]: Without dead ends: 14530 [2019-12-27 06:04:05,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14530 states. [2019-12-27 06:04:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14530 to 14018. [2019-12-27 06:04:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14018 states. [2019-12-27 06:04:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14018 states to 14018 states and 41950 transitions. [2019-12-27 06:04:06,380 INFO L78 Accepts]: Start accepts. Automaton has 14018 states and 41950 transitions. Word has length 57 [2019-12-27 06:04:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:06,380 INFO L462 AbstractCegarLoop]: Abstraction has 14018 states and 41950 transitions. [2019-12-27 06:04:06,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:04:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 14018 states and 41950 transitions. [2019-12-27 06:04:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:04:06,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:06,403 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] [2019-12-27 06:04:06,403 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash -40363112, now seen corresponding path program 1 times [2019-12-27 06:04:06,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:06,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678342063] [2019-12-27 06:04:06,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:06,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678342063] [2019-12-27 06:04:06,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:06,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:04:06,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931769309] [2019-12-27 06:04:06,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:04:06,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:06,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:04:06,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:04:06,723 INFO L87 Difference]: Start difference. First operand 14018 states and 41950 transitions. Second operand 12 states. [2019-12-27 06:04:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:10,893 INFO L93 Difference]: Finished difference Result 33989 states and 98636 transitions. [2019-12-27 06:04:10,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 06:04:10,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-12-27 06:04:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:10,940 INFO L225 Difference]: With dead ends: 33989 [2019-12-27 06:04:10,940 INFO L226 Difference]: Without dead ends: 33824 [2019-12-27 06:04:10,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 06:04:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33824 states. [2019-12-27 06:04:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33824 to 19615. [2019-12-27 06:04:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19615 states. [2019-12-27 06:04:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19615 states to 19615 states and 58548 transitions. [2019-12-27 06:04:11,498 INFO L78 Accepts]: Start accepts. Automaton has 19615 states and 58548 transitions. Word has length 58 [2019-12-27 06:04:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:11,498 INFO L462 AbstractCegarLoop]: Abstraction has 19615 states and 58548 transitions. [2019-12-27 06:04:11,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:04:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 19615 states and 58548 transitions. [2019-12-27 06:04:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:04:11,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:11,523 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] [2019-12-27 06:04:11,523 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 422194454, now seen corresponding path program 2 times [2019-12-27 06:04:11,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:11,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718892698] [2019-12-27 06:04:11,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:11,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718892698] [2019-12-27 06:04:11,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:11,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:04:11,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038349577] [2019-12-27 06:04:11,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:04:11,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:04:11,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:04:11,734 INFO L87 Difference]: Start difference. First operand 19615 states and 58548 transitions. Second operand 10 states. [2019-12-27 06:04:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:13,821 INFO L93 Difference]: Finished difference Result 33414 states and 98161 transitions. [2019-12-27 06:04:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:04:13,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 06:04:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:13,868 INFO L225 Difference]: With dead ends: 33414 [2019-12-27 06:04:13,868 INFO L226 Difference]: Without dead ends: 33288 [2019-12-27 06:04:13,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:04:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33288 states. [2019-12-27 06:04:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33288 to 21485. [2019-12-27 06:04:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21485 states. [2019-12-27 06:04:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21485 states to 21485 states and 64468 transitions. [2019-12-27 06:04:14,303 INFO L78 Accepts]: Start accepts. Automaton has 21485 states and 64468 transitions. Word has length 58 [2019-12-27 06:04:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:14,303 INFO L462 AbstractCegarLoop]: Abstraction has 21485 states and 64468 transitions. [2019-12-27 06:04:14,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:04:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 21485 states and 64468 transitions. [2019-12-27 06:04:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:04:14,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:14,327 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] [2019-12-27 06:04:14,327 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:14,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1343223998, now seen corresponding path program 3 times [2019-12-27 06:04:14,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:14,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533471452] [2019-12-27 06:04:14,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:14,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533471452] [2019-12-27 06:04:14,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:14,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:04:14,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573464908] [2019-12-27 06:04:14,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:04:14,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:14,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:04:14,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:14,410 INFO L87 Difference]: Start difference. First operand 21485 states and 64468 transitions. Second operand 3 states. [2019-12-27 06:04:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:14,478 INFO L93 Difference]: Finished difference Result 21485 states and 64466 transitions. [2019-12-27 06:04:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:04:14,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:04:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:14,508 INFO L225 Difference]: With dead ends: 21485 [2019-12-27 06:04:14,508 INFO L226 Difference]: Without dead ends: 21485 [2019-12-27 06:04:14,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21485 states. [2019-12-27 06:04:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21485 to 16851. [2019-12-27 06:04:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16851 states. [2019-12-27 06:04:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16851 states to 16851 states and 50982 transitions. [2019-12-27 06:04:14,932 INFO L78 Accepts]: Start accepts. Automaton has 16851 states and 50982 transitions. Word has length 58 [2019-12-27 06:04:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:14,933 INFO L462 AbstractCegarLoop]: Abstraction has 16851 states and 50982 transitions. [2019-12-27 06:04:14,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:04:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 16851 states and 50982 transitions. [2019-12-27 06:04:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:04:14,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:14,951 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] [2019-12-27 06:04:14,951 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:14,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1514724949, now seen corresponding path program 1 times [2019-12-27 06:04:14,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:14,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447827015] [2019-12-27 06:04:14,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:04:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:04:15,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:04:15,073 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:04:15,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 |v_ULTIMATE.start_main_~#t733~0.offset_17|) (= v_~y$r_buff0_thd2~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p3_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~y$w_buff1~0_24) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_40) (= (store .cse0 |v_ULTIMATE.start_main_~#t733~0.base_22| 1) |v_#valid_70|) (< 0 |v_#StackHeapBarrier_19|) (= v_~y$r_buff0_thd1~0_9 0) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_cnt~0_28) (= v_~y$r_buff1_thd1~0_8 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t733~0.base_22| 4)) (= v_~y$r_buff0_thd3~0_25 0) (= 0 v_~y$flush_delayed~0_12) (= v_~y$r_buff0_thd0~0_20 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t733~0.base_22|) 0) (= v_~z~0_16 0) (= v_~a~0_10 0) (= 0 v_~weak$$choice2~0_33) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t733~0.base_22| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t733~0.base_22|) |v_ULTIMATE.start_main_~#t733~0.offset_17| 0)) |v_#memory_int_25|) (= 0 v_~y$r_buff1_thd0~0_21) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t733~0.base_22|) (= 0 |v_#NULL.base_7|) (= v_~y$w_buff1_used~0_67 0) (= v_~y$mem_tmp~0_10 0) (= v_~y$r_buff0_thd4~0_19 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (= 0 v_~y$r_buff1_thd4~0_18) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~y$r_buff1_thd3~0_16) (= v_~y$w_buff0_used~0_100 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_27|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_7|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_65, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, ULTIMATE.start_main_~#t733~0.base=|v_ULTIMATE.start_main_~#t733~0.base_22|, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_19, ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_16, ULTIMATE.start_main_~#t733~0.offset=|v_ULTIMATE.start_main_~#t733~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t736~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t736~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t735~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t735~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t734~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t733~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t733~0.offset, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:04:15,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t734~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t734~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t734~0.base_10|) |v_ULTIMATE.start_main_~#t734~0.offset_10| 1)) |v_#memory_int_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t734~0.base_10| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t734~0.base_10| 4)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t734~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t734~0.offset=|v_ULTIMATE.start_main_~#t734~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t734~0.base=|v_ULTIMATE.start_main_~#t734~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t734~0.offset, ULTIMATE.start_main_~#t734~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 06:04:15,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t735~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t735~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t735~0.base_11|) |v_ULTIMATE.start_main_~#t735~0.offset_10| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t735~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t735~0.base_11| 4)) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t735~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t735~0.offset=|v_ULTIMATE.start_main_~#t735~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t735~0.base=|v_ULTIMATE.start_main_~#t735~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t735~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t735~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 06:04:15,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= 1 v_~z~0_6) (= v_~y$r_buff0_thd3~0_21 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_29) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd3~0_20 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_8 0)) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_13) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_12)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_8} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_12} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:04:15,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (not (= |v_ULTIMATE.start_main_~#t736~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t736~0.offset_10|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t736~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t736~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t736~0.base_11| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t736~0.base_11|) |v_ULTIMATE.start_main_~#t736~0.offset_10| 3)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t736~0.base=|v_ULTIMATE.start_main_~#t736~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t736~0.offset=|v_ULTIMATE.start_main_~#t736~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t736~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t736~0.offset] because there is no mapped edge [2019-12-27 06:04:15,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 1 v_~a~0_5) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_5, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 06:04:15,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork0_#t~ite32_Out-382112807| |P3Thread1of1ForFork0_#t~ite33_Out-382112807|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-382112807 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In-382112807 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out-382112807| ~y$w_buff1~0_In-382112807)) (and .cse1 (or .cse2 .cse0) (= |P3Thread1of1ForFork0_#t~ite32_Out-382112807| ~y~0_In-382112807)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-382112807, ~y$w_buff1~0=~y$w_buff1~0_In-382112807, ~y~0=~y~0_In-382112807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-382112807} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-382112807, ~y$w_buff1~0=~y$w_buff1~0_In-382112807, ~y~0=~y~0_In-382112807, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-382112807|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-382112807|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-382112807} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 06:04:15,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1143312944 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1143312944 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1143312944| ~y$w_buff0_used~0_In1143312944) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out1143312944| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1143312944, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1143312944} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1143312944, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1143312944, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1143312944|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 06:04:15,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In-1313974328 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1313974328 256))) (.cse2 (= (mod ~y$r_buff0_thd4~0_In-1313974328 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1313974328 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1313974328| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1313974328| ~y$w_buff1_used~0_In-1313974328) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1313974328, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1313974328, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313974328, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1313974328} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1313974328, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1313974328, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313974328, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1313974328|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1313974328} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 06:04:15,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In1408974866 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1408974866 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out1408974866| ~y$r_buff0_thd4~0_In1408974866)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out1408974866| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1408974866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1408974866} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1408974866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1408974866, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1408974866|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 06:04:15,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1371601449 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-1371601449 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1371601449 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-1371601449 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-1371601449|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite37_Out-1371601449| ~y$r_buff1_thd4~0_In-1371601449)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1371601449, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1371601449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1371601449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1371601449} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1371601449, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1371601449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1371601449, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1371601449|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1371601449} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 06:04:15,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_14) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:04:15,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In426529592 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out426529592| |P1Thread1of1ForFork2_#t~ite11_Out426529592|) (= ~y$w_buff1~0_In426529592 |P1Thread1of1ForFork2_#t~ite11_Out426529592|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In426529592 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In426529592 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In426529592 256))) (and (= 0 (mod ~y$w_buff1_used~0_In426529592 256)) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In426529592| |P1Thread1of1ForFork2_#t~ite11_Out426529592|) (= |P1Thread1of1ForFork2_#t~ite12_Out426529592| ~y$w_buff1~0_In426529592)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In426529592, ~y$w_buff1~0=~y$w_buff1~0_In426529592, ~y$w_buff0_used~0=~y$w_buff0_used~0_In426529592, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In426529592, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In426529592|, ~weak$$choice2~0=~weak$$choice2~0_In426529592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426529592} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In426529592, ~y$w_buff1~0=~y$w_buff1~0_In426529592, ~y$w_buff0_used~0=~y$w_buff0_used~0_In426529592, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In426529592, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out426529592|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out426529592|, ~weak$$choice2~0=~weak$$choice2~0_In426529592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426529592} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:04:15,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In394297616 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out394297616| |P1Thread1of1ForFork2_#t~ite14_Out394297616|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In394297616 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In394297616 256)) .cse1) (= (mod ~y$w_buff0_used~0_In394297616 256) 0) (and (= (mod ~y$w_buff1_used~0_In394297616 256) 0) .cse1))) (= ~y$w_buff0_used~0_In394297616 |P1Thread1of1ForFork2_#t~ite14_Out394297616|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In394297616| |P1Thread1of1ForFork2_#t~ite14_Out394297616|) (= ~y$w_buff0_used~0_In394297616 |P1Thread1of1ForFork2_#t~ite15_Out394297616|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In394297616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In394297616, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In394297616, ~weak$$choice2~0=~weak$$choice2~0_In394297616, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In394297616|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In394297616} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In394297616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In394297616, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In394297616, ~weak$$choice2~0=~weak$$choice2~0_In394297616, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out394297616|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out394297616|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In394297616} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 06:04:15,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_48) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 06:04:15,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-811621041 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-811621041| |P1Thread1of1ForFork2_#t~ite23_Out-811621041|) (= |P1Thread1of1ForFork2_#t~ite24_Out-811621041| ~y$r_buff1_thd2~0_In-811621041)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-811621041| |P1Thread1of1ForFork2_#t~ite23_Out-811621041|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-811621041 256)))) (or (= (mod ~y$w_buff0_used~0_In-811621041 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-811621041 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-811621041 256) 0)))) (= ~y$r_buff1_thd2~0_In-811621041 |P1Thread1of1ForFork2_#t~ite23_Out-811621041|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-811621041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-811621041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-811621041, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-811621041|, ~weak$$choice2~0=~weak$$choice2~0_In-811621041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-811621041} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-811621041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-811621041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-811621041, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-811621041|, ~weak$$choice2~0=~weak$$choice2~0_In-811621041, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-811621041|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-811621041} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 06:04:15,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_19 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 06:04:15,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In776692901 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In776692901 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out776692901| 0)) (and (= ~y$w_buff0_used~0_In776692901 |P2Thread1of1ForFork3_#t~ite28_Out776692901|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In776692901, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In776692901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In776692901, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In776692901, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out776692901|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 06:04:15,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1221139085 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1221139085 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1221139085 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1221139085 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out1221139085| 0)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out1221139085| ~y$w_buff1_used~0_In1221139085) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1221139085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1221139085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1221139085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1221139085} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1221139085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1221139085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1221139085, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1221139085|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1221139085} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 06:04:15,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In2038708414 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2038708414 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out2038708414 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out2038708414 ~y$r_buff0_thd3~0_In2038708414)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2038708414, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2038708414} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out2038708414|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2038708414, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2038708414} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:04:15,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1400017527 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1400017527 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1400017527 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1400017527 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-1400017527 |P2Thread1of1ForFork3_#t~ite31_Out-1400017527|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-1400017527|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1400017527, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400017527, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1400017527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400017527} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1400017527, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400017527, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1400017527, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1400017527|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400017527} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 06:04:15,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_12) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:04:15,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:04:15,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out-2131625616| |ULTIMATE.start_main_#t~ite43_Out-2131625616|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-2131625616 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2131625616 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite42_Out-2131625616| ~y~0_In-2131625616) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-2131625616| ~y$w_buff1~0_In-2131625616)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2131625616, ~y~0=~y~0_In-2131625616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2131625616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131625616} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2131625616, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2131625616|, ~y~0=~y~0_In-2131625616, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2131625616|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2131625616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131625616} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:04:15,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1796881404 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1796881404 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out1796881404|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1796881404| ~y$w_buff0_used~0_In1796881404)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1796881404, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1796881404} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1796881404, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1796881404, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1796881404|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:04:15,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In646726087 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In646726087 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In646726087 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In646726087 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out646726087| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out646726087| ~y$w_buff1_used~0_In646726087)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In646726087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In646726087, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In646726087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In646726087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In646726087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In646726087, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In646726087, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out646726087|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In646726087} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:04:15,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2022905936 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2022905936 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-2022905936|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-2022905936 |ULTIMATE.start_main_#t~ite46_Out-2022905936|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2022905936, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2022905936} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2022905936, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2022905936, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2022905936|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 06:04:15,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1458314949 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1458314949 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1458314949 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1458314949 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1458314949 |ULTIMATE.start_main_#t~ite47_Out1458314949|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite47_Out1458314949|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1458314949, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1458314949, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1458314949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458314949} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1458314949, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1458314949, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1458314949|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1458314949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458314949} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 06:04:15,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_10 2) (= |v_ULTIMATE.start_main_#t~ite47_9| v_~y$r_buff1_thd0~0_15) (= 2 v_~__unbuffered_p3_EAX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:04:15,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:04:15 BasicIcfg [2019-12-27 06:04:15,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:04:15,212 INFO L168 Benchmark]: Toolchain (without parser) took 169549.09 ms. Allocated memory was 140.0 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 99.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:04:15,212 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 140.0 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:04:15,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.29 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 99.2 MB in the beginning and 155.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:04:15,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.99 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:04:15,214 INFO L168 Benchmark]: Boogie Preprocessor took 37.65 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:04:15,214 INFO L168 Benchmark]: RCFGBuilder took 827.76 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 100.8 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:04:15,215 INFO L168 Benchmark]: TraceAbstraction took 167779.53 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 06:04:15,218 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.43 ms. Allocated memory is still 140.0 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.29 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 99.2 MB in the beginning and 155.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.99 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.65 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.76 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 100.8 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167779.53 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7362 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 78681 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t733, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t734, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t735, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t736, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 167.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4242 SDtfs, 4520 SDslu, 11356 SDs, 0 SdLazy, 6889 SolverSat, 248 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241474occurred 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: 85.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 158147 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 919 NumberOfCodeBlocks, 919 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 839 ConstructedInterpolants, 0 QuantifiedInterpolants, 165922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...