/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:49:56,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:49:56,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:49:56,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:49:56,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:49:56,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:49:56,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:49:56,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:49:56,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:49:56,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:49:56,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:49:56,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:49:56,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:49:56,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:49:56,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:49:56,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:49:56,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:49:56,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:49:56,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:49:56,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:49:56,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:49:56,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:49:56,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:49:56,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:49:56,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:49:56,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:49:56,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:49:56,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:49:56,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:49:56,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:49:56,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:49:56,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:49:56,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:49:56,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:49:56,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:49:56,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:49:56,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:49:56,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:49:56,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:49:56,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:49:56,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:49:56,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:49:56,465 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:49:56,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:49:56,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:49:56,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:49:56,467 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:49:56,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:49:56,467 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:49:56,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:49:56,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:49:56,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:49:56,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:49:56,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:49:56,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:49:56,469 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:49:56,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:49:56,469 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:49:56,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:49:56,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:49:56,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:49:56,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:49:56,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:49:56,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:49:56,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:49:56,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:49:56,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:49:56,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:49:56,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:49:56,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:49:56,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:49:56,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:49:56,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:49:56,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:49:56,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:49:56,766 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:49:56,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-18 16:49:56,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b21af5e9/b7188d3c1f96442ab00b51e0af8d3b4b/FLAG91918fba9 [2019-12-18 16:49:57,406 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:49:57,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-18 16:49:57,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b21af5e9/b7188d3c1f96442ab00b51e0af8d3b4b/FLAG91918fba9 [2019-12-18 16:49:57,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b21af5e9/b7188d3c1f96442ab00b51e0af8d3b4b [2019-12-18 16:49:57,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:49:57,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:49:57,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:49:57,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:49:57,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:49:57,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:49:57" (1/1) ... [2019-12-18 16:49:57,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d76d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:57, skipping insertion in model container [2019-12-18 16:49:57,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:49:57" (1/1) ... [2019-12-18 16:49:57,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:49:57,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:49:58,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:49:58,499 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:49:58,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:49:58,711 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:49:58,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58 WrapperNode [2019-12-18 16:49:58,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:49:58,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:49:58,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:49:58,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:49:58,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:49:58,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:49:58,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:49:58,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:49:58,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... [2019-12-18 16:49:58,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:49:58,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:49:58,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:49:58,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:49:58,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:49:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:49:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:49:58,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:49:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:49:58,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:49:58,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:49:58,918 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:49:58,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:49:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:49:58,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:49:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:49:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:49:58,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:49:58,923 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:49:59,724 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:49:59,725 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:49:59,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:49:59 BoogieIcfgContainer [2019-12-18 16:49:59,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:49:59,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:49:59,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:49:59,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:49:59,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:49:57" (1/3) ... [2019-12-18 16:49:59,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75171178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:49:59, skipping insertion in model container [2019-12-18 16:49:59,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:49:58" (2/3) ... [2019-12-18 16:49:59,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75171178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:49:59, skipping insertion in model container [2019-12-18 16:49:59,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:49:59" (3/3) ... [2019-12-18 16:49:59,736 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.opt.i [2019-12-18 16:49:59,746 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:49:59,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:49:59,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:49:59,754 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:49:59,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,844 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,844 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,868 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,868 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:49:59,890 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:49:59,909 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:49:59,909 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:49:59,909 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:49:59,909 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:49:59,910 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:49:59,910 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:49:59,910 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:49:59,910 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:49:59,927 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 16:49:59,929 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 16:50:00,037 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 16:50:00,037 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:50:00,056 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:50:00,083 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 16:50:00,172 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 16:50:00,172 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:50:00,183 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:50:00,208 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 16:50:00,209 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:50:05,928 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 16:50:06,077 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 16:50:06,102 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74173 [2019-12-18 16:50:06,102 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 16:50:06,106 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-18 16:50:15,935 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-18 16:50:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-18 16:50:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:50:15,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:15,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:50:15,944 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:15,950 INFO L82 PathProgramCache]: Analyzing trace with hash 803939489, now seen corresponding path program 1 times [2019-12-18 16:50:15,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:15,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079676749] [2019-12-18 16:50:15,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:16,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079676749] [2019-12-18 16:50:16,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:16,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:50:16,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712689886] [2019-12-18 16:50:16,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:16,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:16,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:16,216 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-18 16:50:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:17,303 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-18 16:50:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:17,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:50:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:20,181 INFO L225 Difference]: With dead ends: 81762 [2019-12-18 16:50:20,182 INFO L226 Difference]: Without dead ends: 77082 [2019-12-18 16:50:20,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-18 16:50:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-18 16:50:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-18 16:50:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-18 16:50:25,422 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-18 16:50:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:25,423 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-18 16:50:25,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-18 16:50:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:50:25,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:25,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:25,431 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:25,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:25,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1596901179, now seen corresponding path program 1 times [2019-12-18 16:50:25,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:25,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511612178] [2019-12-18 16:50:25,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:25,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511612178] [2019-12-18 16:50:25,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:25,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:25,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735294622] [2019-12-18 16:50:25,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:25,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:25,527 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-18 16:50:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:25,665 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-18 16:50:25,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:25,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:50:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:25,747 INFO L225 Difference]: With dead ends: 20478 [2019-12-18 16:50:25,747 INFO L226 Difference]: Without dead ends: 20478 [2019-12-18 16:50:25,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-18 16:50:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-18 16:50:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-18 16:50:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-18 16:50:29,005 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-18 16:50:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:29,006 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-18 16:50:29,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-18 16:50:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:50:29,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:29,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:29,008 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:29,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:29,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1662041210, now seen corresponding path program 1 times [2019-12-18 16:50:29,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:29,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354416401] [2019-12-18 16:50:29,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:29,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354416401] [2019-12-18 16:50:29,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:29,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:29,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167426650] [2019-12-18 16:50:29,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:29,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:29,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:29,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:29,087 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-18 16:50:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:29,447 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-18 16:50:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:50:29,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:50:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:29,525 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 16:50:29,525 INFO L226 Difference]: Without dead ends: 30788 [2019-12-18 16:50:29,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-18 16:50:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-18 16:50:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-18 16:50:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-18 16:50:30,498 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-18 16:50:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:30,498 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-18 16:50:30,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-18 16:50:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:50:30,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:30,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:30,502 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1480512145, now seen corresponding path program 1 times [2019-12-18 16:50:30,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:30,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547015812] [2019-12-18 16:50:30,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:30,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547015812] [2019-12-18 16:50:30,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:30,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:30,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882539782] [2019-12-18 16:50:30,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:30,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:30,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:30,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:30,580 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-18 16:50:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:30,889 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-18 16:50:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:50:30,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:50:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:30,976 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 16:50:30,977 INFO L226 Difference]: Without dead ends: 35512 [2019-12-18 16:50:30,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-18 16:50:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-18 16:50:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-18 16:50:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-18 16:50:32,238 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-18 16:50:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:32,239 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-18 16:50:32,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-18 16:50:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:50:32,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:32,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:32,242 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1480362260, now seen corresponding path program 1 times [2019-12-18 16:50:32,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:32,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689503834] [2019-12-18 16:50:32,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:32,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689503834] [2019-12-18 16:50:32,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:32,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:32,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083927426] [2019-12-18 16:50:32,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:32,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:32,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:32,344 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-18 16:50:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:32,661 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-18 16:50:32,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:50:32,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:50:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:32,747 INFO L225 Difference]: With dead ends: 38443 [2019-12-18 16:50:32,747 INFO L226 Difference]: Without dead ends: 38432 [2019-12-18 16:50:32,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-18 16:50:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-18 16:50:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-18 16:50:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-18 16:50:33,430 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-18 16:50:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:33,430 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-18 16:50:33,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-18 16:50:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:50:33,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:33,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:33,439 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973460, now seen corresponding path program 1 times [2019-12-18 16:50:33,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:33,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32512065] [2019-12-18 16:50:33,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:33,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32512065] [2019-12-18 16:50:33,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:33,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:33,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103392972] [2019-12-18 16:50:33,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:50:33,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:50:33,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:33,843 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-18 16:50:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:34,391 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-18 16:50:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:50:34,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:50:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:34,469 INFO L225 Difference]: With dead ends: 45281 [2019-12-18 16:50:34,469 INFO L226 Difference]: Without dead ends: 45258 [2019-12-18 16:50:34,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-18 16:50:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-18 16:50:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-18 16:50:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-18 16:50:35,185 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-18 16:50:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:35,186 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-18 16:50:35,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:50:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-18 16:50:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:50:35,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:35,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:35,195 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2068123345, now seen corresponding path program 1 times [2019-12-18 16:50:35,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:35,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768406151] [2019-12-18 16:50:35,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:35,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768406151] [2019-12-18 16:50:35,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:35,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:35,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981253947] [2019-12-18 16:50:35,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:50:35,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:50:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:35,291 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-18 16:50:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:36,159 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-18 16:50:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:50:36,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:50:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:36,242 INFO L225 Difference]: With dead ends: 46044 [2019-12-18 16:50:36,242 INFO L226 Difference]: Without dead ends: 46021 [2019-12-18 16:50:36,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-18 16:50:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-18 16:50:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-18 16:50:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-18 16:50:36,869 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-18 16:50:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:36,870 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-18 16:50:36,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:50:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-18 16:50:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:50:36,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:36,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:36,885 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:36,885 INFO L82 PathProgramCache]: Analyzing trace with hash 668919418, now seen corresponding path program 1 times [2019-12-18 16:50:36,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:36,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125331709] [2019-12-18 16:50:36,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:36,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125331709] [2019-12-18 16:50:36,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:36,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:36,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218726603] [2019-12-18 16:50:36,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:36,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:36,946 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-18 16:50:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:37,018 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-18 16:50:37,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:50:37,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:50:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:37,040 INFO L225 Difference]: With dead ends: 11657 [2019-12-18 16:50:37,040 INFO L226 Difference]: Without dead ends: 11657 [2019-12-18 16:50:37,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-18 16:50:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-18 16:50:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-18 16:50:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-18 16:50:37,211 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-18 16:50:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:37,212 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-18 16:50:37,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-18 16:50:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:50:37,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:37,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] [2019-12-18 16:50:37,227 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash 954456655, now seen corresponding path program 1 times [2019-12-18 16:50:37,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:37,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541623199] [2019-12-18 16:50:37,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:37,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541623199] [2019-12-18 16:50:37,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:37,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:37,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739257760] [2019-12-18 16:50:37,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:37,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:37,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:37,270 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-18 16:50:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:37,404 INFO L93 Difference]: Finished difference Result 15100 states and 45684 transitions. [2019-12-18 16:50:37,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:37,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:50:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:37,425 INFO L225 Difference]: With dead ends: 15100 [2019-12-18 16:50:37,425 INFO L226 Difference]: Without dead ends: 15100 [2019-12-18 16:50:37,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15100 states. [2019-12-18 16:50:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15100 to 12271. [2019-12-18 16:50:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-12-18 16:50:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 37679 transitions. [2019-12-18 16:50:37,637 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 37679 transitions. Word has length 39 [2019-12-18 16:50:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:37,637 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 37679 transitions. [2019-12-18 16:50:37,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 37679 transitions. [2019-12-18 16:50:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:50:37,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:37,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:50:37,657 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash 515851026, now seen corresponding path program 1 times [2019-12-18 16:50:37,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:37,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335719767] [2019-12-18 16:50:37,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:37,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335719767] [2019-12-18 16:50:37,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:37,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:50:37,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609452924] [2019-12-18 16:50:37,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:50:37,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:50:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:37,745 INFO L87 Difference]: Start difference. First operand 12271 states and 37679 transitions. Second operand 5 states. [2019-12-18 16:50:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:37,834 INFO L93 Difference]: Finished difference Result 11017 states and 34440 transitions. [2019-12-18 16:50:37,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:50:37,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 16:50:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:37,859 INFO L225 Difference]: With dead ends: 11017 [2019-12-18 16:50:37,860 INFO L226 Difference]: Without dead ends: 11017 [2019-12-18 16:50:37,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-18 16:50:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10393. [2019-12-18 16:50:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-18 16:50:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-18 16:50:38,123 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 39 [2019-12-18 16:50:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:38,124 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-18 16:50:38,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:50:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-18 16:50:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:38,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:38,150 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] [2019-12-18 16:50:38,151 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:38,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:38,151 INFO L82 PathProgramCache]: Analyzing trace with hash 165786421, now seen corresponding path program 1 times [2019-12-18 16:50:38,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:38,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184654432] [2019-12-18 16:50:38,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:38,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184654432] [2019-12-18 16:50:38,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:38,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:50:38,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314643415] [2019-12-18 16:50:38,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:50:38,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:38,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:50:38,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:50:38,289 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 4 states. [2019-12-18 16:50:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:38,378 INFO L93 Difference]: Finished difference Result 18723 states and 58888 transitions. [2019-12-18 16:50:38,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:50:38,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 16:50:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:38,398 INFO L225 Difference]: With dead ends: 18723 [2019-12-18 16:50:38,398 INFO L226 Difference]: Without dead ends: 8627 [2019-12-18 16:50:38,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:50:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-12-18 16:50:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2019-12-18 16:50:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-12-18 16:50:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 27021 transitions. [2019-12-18 16:50:38,584 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 27021 transitions. Word has length 53 [2019-12-18 16:50:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:38,584 INFO L462 AbstractCegarLoop]: Abstraction has 8627 states and 27021 transitions. [2019-12-18 16:50:38,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:50:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 27021 transitions. [2019-12-18 16:50:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:38,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:38,597 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] [2019-12-18 16:50:38,597 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:38,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1891813083, now seen corresponding path program 2 times [2019-12-18 16:50:38,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:38,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165686418] [2019-12-18 16:50:38,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:38,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165686418] [2019-12-18 16:50:38,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:38,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:50:38,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512895139] [2019-12-18 16:50:38,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:50:38,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:38,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:50:38,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:50:38,684 INFO L87 Difference]: Start difference. First operand 8627 states and 27021 transitions. Second operand 7 states. [2019-12-18 16:50:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:39,074 INFO L93 Difference]: Finished difference Result 24029 states and 75191 transitions. [2019-12-18 16:50:39,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:50:39,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:50:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:39,110 INFO L225 Difference]: With dead ends: 24029 [2019-12-18 16:50:39,111 INFO L226 Difference]: Without dead ends: 18333 [2019-12-18 16:50:39,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:50:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-18 16:50:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 10739. [2019-12-18 16:50:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10739 states. [2019-12-18 16:50:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10739 states to 10739 states and 33937 transitions. [2019-12-18 16:50:39,475 INFO L78 Accepts]: Start accepts. Automaton has 10739 states and 33937 transitions. Word has length 53 [2019-12-18 16:50:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:39,475 INFO L462 AbstractCegarLoop]: Abstraction has 10739 states and 33937 transitions. [2019-12-18 16:50:39,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:50:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 10739 states and 33937 transitions. [2019-12-18 16:50:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:39,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:39,492 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] [2019-12-18 16:50:39,492 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1878615555, now seen corresponding path program 3 times [2019-12-18 16:50:39,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:39,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814369012] [2019-12-18 16:50:39,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:39,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814369012] [2019-12-18 16:50:39,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:39,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:50:39,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819086114] [2019-12-18 16:50:39,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:50:39,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:50:39,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:50:39,570 INFO L87 Difference]: Start difference. First operand 10739 states and 33937 transitions. Second operand 7 states. [2019-12-18 16:50:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:39,942 INFO L93 Difference]: Finished difference Result 29619 states and 91701 transitions. [2019-12-18 16:50:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:50:39,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:50:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:39,977 INFO L225 Difference]: With dead ends: 29619 [2019-12-18 16:50:39,977 INFO L226 Difference]: Without dead ends: 21040 [2019-12-18 16:50:39,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:50:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-18 16:50:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 13259. [2019-12-18 16:50:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-12-18 16:50:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 41902 transitions. [2019-12-18 16:50:40,244 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 41902 transitions. Word has length 53 [2019-12-18 16:50:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:40,244 INFO L462 AbstractCegarLoop]: Abstraction has 13259 states and 41902 transitions. [2019-12-18 16:50:40,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:50:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 41902 transitions. [2019-12-18 16:50:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:40,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:40,260 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] [2019-12-18 16:50:40,260 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash 193726155, now seen corresponding path program 4 times [2019-12-18 16:50:40,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:40,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109181060] [2019-12-18 16:50:40,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:40,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109181060] [2019-12-18 16:50:40,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:40,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:40,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550119413] [2019-12-18 16:50:40,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:40,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:40,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:40,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:40,324 INFO L87 Difference]: Start difference. First operand 13259 states and 41902 transitions. Second operand 3 states. [2019-12-18 16:50:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:40,409 INFO L93 Difference]: Finished difference Result 19683 states and 62661 transitions. [2019-12-18 16:50:40,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:40,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:50:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:40,423 INFO L225 Difference]: With dead ends: 19683 [2019-12-18 16:50:40,423 INFO L226 Difference]: Without dead ends: 6496 [2019-12-18 16:50:40,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-12-18 16:50:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-12-18 16:50:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-18 16:50:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 20893 transitions. [2019-12-18 16:50:40,525 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 20893 transitions. Word has length 53 [2019-12-18 16:50:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:40,526 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 20893 transitions. [2019-12-18 16:50:40,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 20893 transitions. [2019-12-18 16:50:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:40,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:40,533 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] [2019-12-18 16:50:40,534 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:40,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:40,534 INFO L82 PathProgramCache]: Analyzing trace with hash 819014287, now seen corresponding path program 5 times [2019-12-18 16:50:40,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:40,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716252659] [2019-12-18 16:50:40,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:40,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716252659] [2019-12-18 16:50:40,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:40,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:50:40,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652135241] [2019-12-18 16:50:40,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:50:40,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:50:40,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:40,647 INFO L87 Difference]: Start difference. First operand 6496 states and 20893 transitions. Second operand 9 states. [2019-12-18 16:50:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:42,069 INFO L93 Difference]: Finished difference Result 34361 states and 106385 transitions. [2019-12-18 16:50:42,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 16:50:42,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 16:50:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:42,109 INFO L225 Difference]: With dead ends: 34361 [2019-12-18 16:50:42,109 INFO L226 Difference]: Without dead ends: 27058 [2019-12-18 16:50:42,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 16:50:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2019-12-18 16:50:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 8895. [2019-12-18 16:50:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8895 states. [2019-12-18 16:50:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 28920 transitions. [2019-12-18 16:50:42,480 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 28920 transitions. Word has length 53 [2019-12-18 16:50:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:42,480 INFO L462 AbstractCegarLoop]: Abstraction has 8895 states and 28920 transitions. [2019-12-18 16:50:42,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:50:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 28920 transitions. [2019-12-18 16:50:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:42,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:42,491 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] [2019-12-18 16:50:42,492 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash 743806145, now seen corresponding path program 6 times [2019-12-18 16:50:42,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:42,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402849825] [2019-12-18 16:50:42,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:42,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402849825] [2019-12-18 16:50:42,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:42,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:50:42,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561669822] [2019-12-18 16:50:42,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:50:42,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:50:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:42,602 INFO L87 Difference]: Start difference. First operand 8895 states and 28920 transitions. Second operand 9 states. [2019-12-18 16:50:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:43,798 INFO L93 Difference]: Finished difference Result 25540 states and 79803 transitions. [2019-12-18 16:50:43,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 16:50:43,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 16:50:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:43,834 INFO L225 Difference]: With dead ends: 25540 [2019-12-18 16:50:43,834 INFO L226 Difference]: Without dead ends: 23475 [2019-12-18 16:50:43,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 16:50:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23475 states. [2019-12-18 16:50:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23475 to 8823. [2019-12-18 16:50:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-12-18 16:50:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 28692 transitions. [2019-12-18 16:50:44,081 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 28692 transitions. Word has length 53 [2019-12-18 16:50:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:44,081 INFO L462 AbstractCegarLoop]: Abstraction has 8823 states and 28692 transitions. [2019-12-18 16:50:44,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:50:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 28692 transitions. [2019-12-18 16:50:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:44,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:44,094 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] [2019-12-18 16:50:44,094 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash -249470771, now seen corresponding path program 7 times [2019-12-18 16:50:44,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:44,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78551881] [2019-12-18 16:50:44,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:44,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78551881] [2019-12-18 16:50:44,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:44,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:50:44,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255935656] [2019-12-18 16:50:44,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:50:44,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:50:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:44,259 INFO L87 Difference]: Start difference. First operand 8823 states and 28692 transitions. Second operand 9 states. [2019-12-18 16:50:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:44,984 INFO L93 Difference]: Finished difference Result 13710 states and 41477 transitions. [2019-12-18 16:50:44,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:50:44,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 16:50:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:45,004 INFO L225 Difference]: With dead ends: 13710 [2019-12-18 16:50:45,005 INFO L226 Difference]: Without dead ends: 13626 [2019-12-18 16:50:45,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:50:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13626 states. [2019-12-18 16:50:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13626 to 11475. [2019-12-18 16:50:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-18 16:50:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 35386 transitions. [2019-12-18 16:50:45,205 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 35386 transitions. Word has length 53 [2019-12-18 16:50:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:45,205 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 35386 transitions. [2019-12-18 16:50:45,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:50:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 35386 transitions. [2019-12-18 16:50:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:45,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:45,221 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] [2019-12-18 16:50:45,221 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:45,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1491786391, now seen corresponding path program 8 times [2019-12-18 16:50:45,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:45,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120701922] [2019-12-18 16:50:45,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:45,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-18 16:50:45,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120701922] [2019-12-18 16:50:45,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:45,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:50:45,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296067719] [2019-12-18 16:50:45,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:50:45,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:45,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:50:45,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:50:45,366 INFO L87 Difference]: Start difference. First operand 11475 states and 35386 transitions. Second operand 8 states. [2019-12-18 16:50:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:46,261 INFO L93 Difference]: Finished difference Result 17460 states and 52110 transitions. [2019-12-18 16:50:46,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:50:46,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 16:50:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:46,285 INFO L225 Difference]: With dead ends: 17460 [2019-12-18 16:50:46,285 INFO L226 Difference]: Without dead ends: 17350 [2019-12-18 16:50:46,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:50:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17350 states. [2019-12-18 16:50:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17350 to 13803. [2019-12-18 16:50:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13803 states. [2019-12-18 16:50:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13803 states to 13803 states and 42125 transitions. [2019-12-18 16:50:46,517 INFO L78 Accepts]: Start accepts. Automaton has 13803 states and 42125 transitions. Word has length 53 [2019-12-18 16:50:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:46,517 INFO L462 AbstractCegarLoop]: Abstraction has 13803 states and 42125 transitions. [2019-12-18 16:50:46,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:50:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13803 states and 42125 transitions. [2019-12-18 16:50:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:46,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:46,533 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] [2019-12-18 16:50:46,533 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:46,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1750340863, now seen corresponding path program 9 times [2019-12-18 16:50:46,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:46,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760832115] [2019-12-18 16:50:46,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:46,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760832115] [2019-12-18 16:50:46,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:46,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:50:46,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184167201] [2019-12-18 16:50:46,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:50:46,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:46,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:50:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:46,666 INFO L87 Difference]: Start difference. First operand 13803 states and 42125 transitions. Second operand 9 states. [2019-12-18 16:50:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:47,662 INFO L93 Difference]: Finished difference Result 19763 states and 58575 transitions. [2019-12-18 16:50:47,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:50:47,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 16:50:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:47,690 INFO L225 Difference]: With dead ends: 19763 [2019-12-18 16:50:47,690 INFO L226 Difference]: Without dead ends: 19643 [2019-12-18 16:50:47,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:50:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19643 states. [2019-12-18 16:50:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19643 to 14172. [2019-12-18 16:50:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14172 states. [2019-12-18 16:50:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14172 states to 14172 states and 43180 transitions. [2019-12-18 16:50:47,967 INFO L78 Accepts]: Start accepts. Automaton has 14172 states and 43180 transitions. Word has length 53 [2019-12-18 16:50:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:47,967 INFO L462 AbstractCegarLoop]: Abstraction has 14172 states and 43180 transitions. [2019-12-18 16:50:47,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:50:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 14172 states and 43180 transitions. [2019-12-18 16:50:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:50:47,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:47,981 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] [2019-12-18 16:50:47,982 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 929621469, now seen corresponding path program 10 times [2019-12-18 16:50:47,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:47,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101938305] [2019-12-18 16:50:47,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:48,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101938305] [2019-12-18 16:50:48,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:48,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:48,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632386175] [2019-12-18 16:50:48,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:48,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:48,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:48,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:48,036 INFO L87 Difference]: Start difference. First operand 14172 states and 43180 transitions. Second operand 3 states. [2019-12-18 16:50:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:48,094 INFO L93 Difference]: Finished difference Result 14170 states and 43175 transitions. [2019-12-18 16:50:48,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:48,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:50:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:48,119 INFO L225 Difference]: With dead ends: 14170 [2019-12-18 16:50:48,120 INFO L226 Difference]: Without dead ends: 14170 [2019-12-18 16:50:48,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14170 states. [2019-12-18 16:50:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14170 to 12372. [2019-12-18 16:50:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12372 states. [2019-12-18 16:50:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12372 states to 12372 states and 38272 transitions. [2019-12-18 16:50:48,321 INFO L78 Accepts]: Start accepts. Automaton has 12372 states and 38272 transitions. Word has length 53 [2019-12-18 16:50:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:48,321 INFO L462 AbstractCegarLoop]: Abstraction has 12372 states and 38272 transitions. [2019-12-18 16:50:48,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 12372 states and 38272 transitions. [2019-12-18 16:50:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:50:48,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:48,335 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] [2019-12-18 16:50:48,335 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1788158321, now seen corresponding path program 1 times [2019-12-18 16:50:48,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:48,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795908869] [2019-12-18 16:50:48,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:48,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795908869] [2019-12-18 16:50:48,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:48,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:50:48,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830516675] [2019-12-18 16:50:48,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:50:48,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:48,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:50:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:48,392 INFO L87 Difference]: Start difference. First operand 12372 states and 38272 transitions. Second operand 3 states. [2019-12-18 16:50:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:48,437 INFO L93 Difference]: Finished difference Result 9673 states and 29682 transitions. [2019-12-18 16:50:48,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:50:48,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 16:50:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:48,455 INFO L225 Difference]: With dead ends: 9673 [2019-12-18 16:50:48,455 INFO L226 Difference]: Without dead ends: 9673 [2019-12-18 16:50:48,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:50:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9673 states. [2019-12-18 16:50:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9673 to 9377. [2019-12-18 16:50:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9377 states. [2019-12-18 16:50:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9377 states to 9377 states and 28802 transitions. [2019-12-18 16:50:48,730 INFO L78 Accepts]: Start accepts. Automaton has 9377 states and 28802 transitions. Word has length 54 [2019-12-18 16:50:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:48,730 INFO L462 AbstractCegarLoop]: Abstraction has 9377 states and 28802 transitions. [2019-12-18 16:50:48,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:50:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9377 states and 28802 transitions. [2019-12-18 16:50:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:50:48,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:48,740 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] [2019-12-18 16:50:48,741 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:48,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:48,741 INFO L82 PathProgramCache]: Analyzing trace with hash 404282337, now seen corresponding path program 1 times [2019-12-18 16:50:48,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:48,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761857968] [2019-12-18 16:50:48,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:48,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761857968] [2019-12-18 16:50:48,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:48,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:50:48,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338116667] [2019-12-18 16:50:48,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:50:48,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:48,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:50:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:50:48,857 INFO L87 Difference]: Start difference. First operand 9377 states and 28802 transitions. Second operand 9 states. [2019-12-18 16:50:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:50,045 INFO L93 Difference]: Finished difference Result 17302 states and 52725 transitions. [2019-12-18 16:50:50,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:50:50,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 16:50:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:50,071 INFO L225 Difference]: With dead ends: 17302 [2019-12-18 16:50:50,071 INFO L226 Difference]: Without dead ends: 11207 [2019-12-18 16:50:50,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:50:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11207 states. [2019-12-18 16:50:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11207 to 9687. [2019-12-18 16:50:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9687 states. [2019-12-18 16:50:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9687 states to 9687 states and 29436 transitions. [2019-12-18 16:50:50,299 INFO L78 Accepts]: Start accepts. Automaton has 9687 states and 29436 transitions. Word has length 55 [2019-12-18 16:50:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:50,299 INFO L462 AbstractCegarLoop]: Abstraction has 9687 states and 29436 transitions. [2019-12-18 16:50:50,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:50:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9687 states and 29436 transitions. [2019-12-18 16:50:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:50:50,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:50,313 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] [2019-12-18 16:50:50,313 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash 905870895, now seen corresponding path program 2 times [2019-12-18 16:50:50,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:50,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641626211] [2019-12-18 16:50:50,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:50,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641626211] [2019-12-18 16:50:50,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:50,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:50:50,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130620852] [2019-12-18 16:50:50,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:50:50,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:50,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:50:50,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:50:50,453 INFO L87 Difference]: Start difference. First operand 9687 states and 29436 transitions. Second operand 11 states. [2019-12-18 16:50:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:51,188 INFO L93 Difference]: Finished difference Result 12973 states and 38798 transitions. [2019-12-18 16:50:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:50:51,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 16:50:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:51,204 INFO L225 Difference]: With dead ends: 12973 [2019-12-18 16:50:51,204 INFO L226 Difference]: Without dead ends: 10255 [2019-12-18 16:50:51,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:50:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2019-12-18 16:50:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 9178. [2019-12-18 16:50:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9178 states. [2019-12-18 16:50:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9178 states to 9178 states and 27884 transitions. [2019-12-18 16:50:51,342 INFO L78 Accepts]: Start accepts. Automaton has 9178 states and 27884 transitions. Word has length 55 [2019-12-18 16:50:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:51,342 INFO L462 AbstractCegarLoop]: Abstraction has 9178 states and 27884 transitions. [2019-12-18 16:50:51,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:50:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9178 states and 27884 transitions. [2019-12-18 16:50:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:50:51,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:51,351 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] [2019-12-18 16:50:51,351 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:50:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:51,352 INFO L82 PathProgramCache]: Analyzing trace with hash 406067685, now seen corresponding path program 3 times [2019-12-18 16:50:51,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:51,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435932210] [2019-12-18 16:50:51,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:50:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:50:51,459 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:50:51,459 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:50:51,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_335 0) (= 0 v_~y$r_buff1_thd3~0_125) (= v_~x~0_35 0) (= v_~y$w_buff1~0_269 0) (= 0 v_~y$r_buff1_thd2~0_133) (= v_~a~0_54 0) (= v_~y$w_buff1_used~0_559 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t642~0.base_28|)) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~y$r_buff0_thd2~0_172) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t642~0.base_28|) (= |v_ULTIMATE.start_main_~#t642~0.offset_19| 0) (= v_~y$w_buff0_used~0_854 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= v_~__unbuffered_p0_EBX~0_53 0) (= v_~z~0_107 0) (= 0 v_~y$r_buff0_thd3~0_136) (= v_~weak$$choice2~0_153 0) (= v_~y$mem_tmp~0_47 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t642~0.base_28| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t642~0.base_28| 4)) (= v_~__unbuffered_p2_EBX~0_59 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_cnt~0_162 0) (= 0 v_~y$flush_delayed~0_90) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_138 0) (= 0 v_~y$w_buff0~0_440) (= v_~y$r_buff1_thd1~0_236 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_34) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_28|) |v_ULTIMATE.start_main_~#t642~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_136 0) (= v_~y~0_214 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t642~0.offset=|v_ULTIMATE.start_main_~#t642~0.offset_19|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_23|, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~x~0=v_~x~0_35, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_854, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_95|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_67|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_17|, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ULTIMATE.start_main_~#t642~0.base=|v_ULTIMATE.start_main_~#t642~0.base_28|, ~y~0=v_~y~0_214, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_17|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_17|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_138, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t642~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t644~0.base, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t644~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t642~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:50:51,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t643~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t643~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t643~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11|) |v_ULTIMATE.start_main_~#t643~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t643~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_10|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 16:50:51,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11|) |v_ULTIMATE.start_main_~#t644~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t644~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t644~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t644~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t644~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t644~0.base, ULTIMATE.start_main_~#t644~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 16:50:51,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] P1ENTRY-->L5-3: Formula: (and (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-945179644|) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-945179644 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-945179644|) (= |P1Thread1of1ForFork1_#in~arg.base_In-945179644| P1Thread1of1ForFork1_~arg.base_Out-945179644) (= P1Thread1of1ForFork1_~arg.offset_Out-945179644 |P1Thread1of1ForFork1_#in~arg.offset_In-945179644|) (= ~y$w_buff0_used~0_Out-945179644 1) (= ~y$w_buff1_used~0_Out-945179644 ~y$w_buff0_used~0_In-945179644) (= ~y$w_buff0~0_In-945179644 ~y$w_buff1~0_Out-945179644) (= ~y$w_buff0~0_Out-945179644 1) (= (mod ~y$w_buff1_used~0_Out-945179644 256) 0)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-945179644, ~y$w_buff0~0=~y$w_buff0~0_In-945179644, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-945179644|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-945179644|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-945179644, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-945179644, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-945179644, ~y$w_buff1~0=~y$w_buff1~0_Out-945179644, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-945179644|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-945179644, ~y$w_buff0~0=~y$w_buff0~0_Out-945179644, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-945179644|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-945179644|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-945179644} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:50:51,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork2_#t~ite32_Out1907382311| |P2Thread1of1ForFork2_#t~ite33_Out1907382311|)) (.cse1 (= (mod ~y$w_buff1_used~0_In1907382311 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1907382311 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In1907382311 |P2Thread1of1ForFork2_#t~ite32_Out1907382311|)) (and (= |P2Thread1of1ForFork2_#t~ite32_Out1907382311| ~y$w_buff1~0_In1907382311) .cse2 (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1907382311, ~y$w_buff1~0=~y$w_buff1~0_In1907382311, ~y~0=~y~0_In1907382311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1907382311} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1907382311, ~y$w_buff1~0=~y$w_buff1~0_In1907382311, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out1907382311|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out1907382311|, ~y~0=~y~0_In1907382311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1907382311} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 16:50:51,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-780670132 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-780670132 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-780670132 |P1Thread1of1ForFork1_#t~ite28_Out-780670132|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-780670132| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-780670132, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-780670132} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-780670132, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-780670132, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-780670132|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 16:50:51,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-773065024 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-773065024 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite34_Out-773065024| ~y$w_buff0_used~0_In-773065024) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-773065024| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-773065024, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-773065024} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-773065024|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-773065024, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-773065024} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 16:50:51,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In412074987 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In412074987 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In412074987 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In412074987 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In412074987 |P2Thread1of1ForFork2_#t~ite35_Out412074987|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out412074987|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In412074987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In412074987, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In412074987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In412074987} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out412074987|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In412074987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In412074987, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In412074987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In412074987} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 16:50:51,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-719714567 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-719714567 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-719714567 |P2Thread1of1ForFork2_#t~ite36_Out-719714567|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-719714567|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-719714567, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-719714567} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-719714567|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-719714567, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-719714567} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 16:50:51,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-919531764 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-919531764 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-919531764 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-919531764 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite37_Out-919531764| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite37_Out-919531764| ~y$r_buff1_thd3~0_In-919531764)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-919531764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-919531764, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-919531764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-919531764} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-919531764|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-919531764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-919531764, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-919531764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-919531764} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 16:50:51,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_40| v_~y$r_buff1_thd3~0_74) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 16:50:51,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1417630485 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1417630485 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1417630485 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1417630485 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out1417630485|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1417630485| ~y$w_buff1_used~0_In1417630485) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1417630485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1417630485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1417630485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1417630485} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1417630485, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1417630485|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1417630485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1417630485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1417630485} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 16:50:51,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In345640770 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In345640770 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out345640770 ~y$r_buff0_thd2~0_In345640770) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd2~0_Out345640770 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In345640770, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In345640770} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out345640770|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In345640770, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out345640770} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:50:51,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In991193568 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In991193568 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In991193568 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In991193568 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite31_Out991193568| 0)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out991193568| ~y$r_buff1_thd2~0_In991193568) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In991193568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In991193568, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In991193568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In991193568} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In991193568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In991193568, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out991193568|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In991193568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In991193568} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 16:50:51,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#t~ite31_40| v_~y$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 16:50:51,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L750-->L750-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-165850753 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_In-165850753| |P0Thread1of1ForFork0_#t~ite8_Out-165850753|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite9_Out-165850753| ~y$w_buff0~0_In-165850753)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite9_Out-165850753| |P0Thread1of1ForFork0_#t~ite8_Out-165850753|) (= ~y$w_buff0~0_In-165850753 |P0Thread1of1ForFork0_#t~ite8_Out-165850753|) (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-165850753 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-165850753 256)) (and (= (mod ~y$r_buff1_thd1~0_In-165850753 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In-165850753 256) 0) .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-165850753, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-165850753, ~y$w_buff0~0=~y$w_buff0~0_In-165850753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-165850753, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In-165850753|, ~weak$$choice2~0=~weak$$choice2~0_In-165850753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165850753} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-165850753, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-165850753|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-165850753, ~y$w_buff0~0=~y$w_buff0~0_In-165850753, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-165850753|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-165850753, ~weak$$choice2~0=~weak$$choice2~0_In-165850753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165850753} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 16:50:51,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L751-->L751-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1171515774 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out1171515774| ~y$w_buff1~0_In1171515774) (= |P0Thread1of1ForFork0_#t~ite11_Out1171515774| |P0Thread1of1ForFork0_#t~ite12_Out1171515774|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1171515774 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1171515774 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1171515774 256)) (and .cse0 (= (mod ~y$r_buff1_thd1~0_In1171515774 256) 0)))) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite11_In1171515774| |P0Thread1of1ForFork0_#t~ite11_Out1171515774|) (= |P0Thread1of1ForFork0_#t~ite12_Out1171515774| ~y$w_buff1~0_In1171515774)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In1171515774|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1171515774, ~y$w_buff1~0=~y$w_buff1~0_In1171515774, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1171515774, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1171515774, ~weak$$choice2~0=~weak$$choice2~0_In1171515774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1171515774} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out1171515774|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1171515774, ~y$w_buff1~0=~y$w_buff1~0_In1171515774, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1171515774, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1171515774, ~weak$$choice2~0=~weak$$choice2~0_In1171515774, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1171515774|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1171515774} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 16:50:51,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L754-->L755-8: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite22_35| |v_P0Thread1of1ForFork0_#t~ite22_34|) (= |v_P0Thread1of1ForFork0_#t~ite23_31| |v_P0Thread1of1ForFork0_#t~ite23_30|) (= v_~y$r_buff1_thd1~0_224 |v_P0Thread1of1ForFork0_#t~ite24_32|) (= v_~y$r_buff0_thd1~0_326 v_~y$r_buff0_thd1~0_325) (not (= 0 (mod v_~weak$$choice2~0_143 256)))) InVars {P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_31|} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_37|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_48|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_33|, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite24=|v_P0Thread1of1ForFork0_#t~ite24_32|, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_30|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 16:50:51,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (not (= (mod v_~y$flush_delayed~0_17 256) 0)) (= v_~y~0_46 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_16) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 16:50:51,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_42) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:50:51,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1833754781 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1833754781 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1833754781 |ULTIMATE.start_main_#t~ite41_Out1833754781|)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In1833754781 |ULTIMATE.start_main_#t~ite41_Out1833754781|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1833754781, ~y~0=~y~0_In1833754781, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1833754781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1833754781} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1833754781|, ~y$w_buff1~0=~y$w_buff1~0_In1833754781, ~y~0=~y~0_In1833754781, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1833754781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1833754781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 16:50:51,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:50:51,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1485967104 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1485967104 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1485967104|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1485967104 |ULTIMATE.start_main_#t~ite43_Out-1485967104|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1485967104, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1485967104} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1485967104, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1485967104, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1485967104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:50:51,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1982819849 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1982819849 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1982819849 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1982819849 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1982819849| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out1982819849| ~y$w_buff1_used~0_In1982819849)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1982819849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1982819849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1982819849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1982819849} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1982819849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1982819849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1982819849, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1982819849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1982819849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:50:51,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-450547953 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-450547953 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-450547953| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-450547953| ~y$r_buff0_thd0~0_In-450547953) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-450547953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-450547953} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-450547953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-450547953, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-450547953|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:50:51,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1629149490 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1629149490 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1629149490 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1629149490 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1629149490| ~y$r_buff1_thd0~0_In-1629149490) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1629149490|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1629149490, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1629149490, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1629149490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1629149490} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1629149490, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1629149490, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1629149490|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1629149490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1629149490} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:50:51,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= v_~z~0_50 2) (= 1 v_~__unbuffered_p0_EAX~0_34) (= v_~__unbuffered_p0_EBX~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 2 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite46_39| v_~y$r_buff1_thd0~0_74) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:50:51,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:50:51 BasicIcfg [2019-12-18 16:50:51,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:50:51,595 INFO L168 Benchmark]: Toolchain (without parser) took 53896.08 ms. Allocated memory was 146.3 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 102.0 MB in the beginning and 690.8 MB in the end (delta: -588.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 16:50:51,595 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:50:51,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1011.67 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 101.6 MB in the beginning and 157.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:51,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.09 ms. Allocated memory is still 205.0 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:51,597 INFO L168 Benchmark]: Boogie Preprocessor took 37.33 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:51,597 INFO L168 Benchmark]: RCFGBuilder took 910.22 ms. Allocated memory is still 205.0 MB. Free memory was 151.8 MB in the beginning and 105.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:51,598 INFO L168 Benchmark]: TraceAbstraction took 51865.92 ms. Allocated memory was 205.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 104.4 MB in the beginning and 690.8 MB in the end (delta: -586.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 16:50:51,600 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1011.67 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 101.6 MB in the beginning and 157.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.09 ms. Allocated memory is still 205.0 MB. Free memory was 157.0 MB in the beginning and 154.4 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.33 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 910.22 ms. Allocated memory is still 205.0 MB. Free memory was 151.8 MB in the beginning and 105.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51865.92 ms. Allocated memory was 205.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 104.4 MB in the beginning and 690.8 MB in the end (delta: -586.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 6616 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74173 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t642, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t643, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t644, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 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) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 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 [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 51.5s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4172 SDtfs, 6098 SDslu, 12072 SDs, 0 SdLazy, 6154 SolverSat, 330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 44 SyntacticMatches, 17 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 111552 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 955 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 154749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...