/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:00:23,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:00:23,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:00:23,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:00:23,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:00:23,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:00:23,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:00:23,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:00:23,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:00:23,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:00:23,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:00:23,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:00:23,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:00:23,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:00:23,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:00:23,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:00:23,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:00:23,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:00:23,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:00:23,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:00:23,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:00:23,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:00:23,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:00:23,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:00:23,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:00:23,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:00:23,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:00:23,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:00:23,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:00:23,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:00:23,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:00:23,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:00:23,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:00:23,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:00:23,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:00:23,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:00:23,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:00:23,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:00:23,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:00:23,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:00:23,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:00:23,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:00:23,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:00:23,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:00:23,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:00:23,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:00:23,522 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:00:23,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:00:23,523 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:00:23,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:00:23,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:00:23,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:00:23,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:00:23,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:00:23,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:00:23,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:00:23,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:00:23,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:00:23,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:00:23,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:00:23,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:00:23,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:00:23,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:00:23,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:00:23,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:00:23,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:00:23,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:00:23,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:00:23,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:00:23,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:00:23,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:00:23,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:00:23,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:00:23,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:00:23,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:00:23,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:00:23,864 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:00:23,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-27 00:00:23,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d196b33/f687e1957d1a4a7e996709031eddcd22/FLAGa2121b59f [2019-12-27 00:00:24,500 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:00:24,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-27 00:00:24,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d196b33/f687e1957d1a4a7e996709031eddcd22/FLAGa2121b59f [2019-12-27 00:00:24,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d196b33/f687e1957d1a4a7e996709031eddcd22 [2019-12-27 00:00:24,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:00:24,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:00:24,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:00:24,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:00:24,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:00:24,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:00:24" (1/1) ... [2019-12-27 00:00:24,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be2d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:24, skipping insertion in model container [2019-12-27 00:00:24,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:00:24" (1/1) ... [2019-12-27 00:00:24,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:00:24,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:00:25,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:00:25,458 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:00:25,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:00:25,623 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:00:25,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25 WrapperNode [2019-12-27 00:00:25,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:00:25,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:00:25,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:00:25,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:00:25,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:00:25,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:00:25,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:00:25,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:00:25,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... [2019-12-27 00:00:25,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:00:25,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:00:25,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:00:25,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:00:25,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:00:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:00:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:00:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:00:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:00:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:00:25,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:00:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:00:25,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:00:25,792 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:00:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:00:25,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:00:25,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:00:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:00:25,796 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:00:26,557 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:00:26,558 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:00:26,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:00:26 BoogieIcfgContainer [2019-12-27 00:00:26,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:00:26,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:00:26,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:00:26,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:00:26,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:00:24" (1/3) ... [2019-12-27 00:00:26,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542883d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:00:26, skipping insertion in model container [2019-12-27 00:00:26,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:00:25" (2/3) ... [2019-12-27 00:00:26,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542883d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:00:26, skipping insertion in model container [2019-12-27 00:00:26,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:00:26" (3/3) ... [2019-12-27 00:00:26,568 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc.i [2019-12-27 00:00:26,579 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:00:26,579 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:00:26,587 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:00:26,588 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:00:26,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,631 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,631 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,678 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,679 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,700 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,700 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,716 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,716 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:00:26,741 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:00:26,761 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:00:26,761 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:00:26,761 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:00:26,761 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:00:26,761 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:00:26,762 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:00:26,762 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:00:26,762 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:00:26,779 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 00:00:26,781 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 00:00:26,882 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 00:00:26,882 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:00:26,899 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:00:26,923 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 00:00:26,975 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 00:00:26,976 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:00:26,983 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:00:27,004 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 00:00:27,005 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:00:32,659 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 00:00:32,814 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 00:00:32,846 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 00:00:32,846 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 00:00:32,850 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 00:00:44,552 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 00:00:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 00:00:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 00:00:44,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:00:44,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 00:00:44,561 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:00:44,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:00:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 00:00:44,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:00:44,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416536647] [2019-12-27 00:00:44,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:00:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:00:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:00:44,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416536647] [2019-12-27 00:00:44,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:00:44,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:00:44,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629166100] [2019-12-27 00:00:44,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:00:44,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:00:44,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:00:44,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:00:44,875 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 00:00:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:00:47,428 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 00:00:47,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:00:47,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 00:00:47,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:00:47,989 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 00:00:47,989 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 00:00:47,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:00:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 00:00:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 00:00:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 00:00:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 00:00:55,941 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 00:00:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:00:55,941 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 00:00:55,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:00:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 00:00:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:00:55,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:00:55,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:00:55,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:00:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:00:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 00:00:55,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:00:55,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32897382] [2019-12-27 00:00:55,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:00:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:00:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:00:56,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32897382] [2019-12-27 00:00:56,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:00:56,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:00:56,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492986177] [2019-12-27 00:00:56,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:00:56,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:00:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:00:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:00:56,134 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 00:01:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:00,378 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 00:01:00,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:01:00,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:01:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:00,848 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 00:01:00,849 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 00:01:00,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:01:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 00:01:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 00:01:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 00:01:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 00:01:14,626 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 00:01:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:14,629 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 00:01:14,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:01:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 00:01:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:01:14,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:14,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:14,635 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 00:01:14,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:14,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59986345] [2019-12-27 00:01:14,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:14,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59986345] [2019-12-27 00:01:14,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:14,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:01:14,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611979765] [2019-12-27 00:01:14,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:01:14,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:14,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:01:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:01:14,719 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 00:01:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:14,842 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 00:01:14,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:01:14,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 00:01:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:14,907 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 00:01:14,908 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 00:01:14,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:01:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 00:01:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 00:01:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 00:01:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 00:01:15,519 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 00:01:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:15,519 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 00:01:15,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:01:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 00:01:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:01:15,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:15,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:15,522 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 00:01:15,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:15,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111475864] [2019-12-27 00:01:15,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:15,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111475864] [2019-12-27 00:01:15,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:15,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:01:15,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993415273] [2019-12-27 00:01:15,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:01:15,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:15,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:01:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:01:15,628 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 00:01:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:16,121 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 00:01:16,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:01:16,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 00:01:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:16,213 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 00:01:16,213 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 00:01:16,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:01:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 00:01:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 00:01:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 00:01:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 00:01:17,977 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 00:01:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:17,977 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 00:01:17,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:01:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 00:01:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:01:17,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:17,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:17,989 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 00:01:17,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:17,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383974533] [2019-12-27 00:01:17,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:18,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383974533] [2019-12-27 00:01:18,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:18,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:01:18,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892427501] [2019-12-27 00:01:18,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:01:18,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:18,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:01:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:01:18,113 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 00:01:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:19,029 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 00:01:19,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:01:19,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:01:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:19,117 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 00:01:19,117 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 00:01:19,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:01:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 00:01:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 00:01:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 00:01:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 00:01:19,817 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 00:01:19,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:19,817 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 00:01:19,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:01:19,817 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 00:01:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:01:19,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:19,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:19,835 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 00:01:19,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:19,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77000281] [2019-12-27 00:01:19,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:20,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77000281] [2019-12-27 00:01:20,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:20,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:01:20,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750347098] [2019-12-27 00:01:20,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:01:20,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:20,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:01:20,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:01:20,605 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 00:01:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:20,672 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 00:01:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:01:20,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 00:01:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:20,697 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 00:01:20,697 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 00:01:20,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:01:20,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 00:01:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 00:01:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 00:01:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 00:01:20,908 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 00:01:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:20,909 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 00:01:20,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:01:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 00:01:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 00:01:20,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:20,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:20,926 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 00:01:20,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:20,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25614404] [2019-12-27 00:01:20,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:21,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25614404] [2019-12-27 00:01:21,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:21,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:01:21,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756784178] [2019-12-27 00:01:21,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:01:21,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:01:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:01:21,009 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 00:01:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:21,076 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 00:01:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:01:21,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 00:01:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:21,094 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 00:01:21,095 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 00:01:21,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:01:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 00:01:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 00:01:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 00:01:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 00:01:21,265 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 00:01:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:21,266 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 00:01:21,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:01:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 00:01:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:21,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:21,283 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-27 00:01:21,284 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 00:01:21,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:21,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341514820] [2019-12-27 00:01:21,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:21,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341514820] [2019-12-27 00:01:21,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:21,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:01:21,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211604086] [2019-12-27 00:01:21,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:01:21,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:21,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:01:21,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:01:21,375 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-27 00:01:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:21,481 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-27 00:01:21,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:01:21,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 00:01:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:21,506 INFO L225 Difference]: With dead ends: 20009 [2019-12-27 00:01:21,506 INFO L226 Difference]: Without dead ends: 9365 [2019-12-27 00:01:21,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:01:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-27 00:01:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-27 00:01:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 00:01:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 00:01:21,730 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 00:01:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:21,730 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 00:01:21,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:01:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 00:01:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:21,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:21,751 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-27 00:01:21,751 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 00:01:21,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:21,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924883593] [2019-12-27 00:01:21,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924883593] [2019-12-27 00:01:21,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:21,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:01:21,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527485295] [2019-12-27 00:01:21,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:01:21,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:01:21,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:01:21,886 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-27 00:01:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:22,291 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 00:01:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:01:22,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:01:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:22,319 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 00:01:22,319 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 00:01:22,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:01:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 00:01:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 00:01:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 00:01:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 00:01:22,547 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 00:01:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:22,547 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 00:01:22,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:01:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 00:01:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:22,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:22,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:22,564 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:22,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:22,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 00:01:22,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:22,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781322304] [2019-12-27 00:01:22,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:22,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781322304] [2019-12-27 00:01:22,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:22,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:01:22,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70147753] [2019-12-27 00:01:22,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:01:22,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:22,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:01:22,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:01:22,676 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-27 00:01:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:23,120 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-27 00:01:23,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:01:23,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:01:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:23,152 INFO L225 Difference]: With dead ends: 27840 [2019-12-27 00:01:23,152 INFO L226 Difference]: Without dead ends: 19924 [2019-12-27 00:01:23,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:01:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-27 00:01:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-27 00:01:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 00:01:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 00:01:23,911 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 00:01:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:23,911 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 00:01:23,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:01:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 00:01:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:23,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:23,931 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-27 00:01:23,931 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:23,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 00:01:23,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:23,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650899597] [2019-12-27 00:01:23,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:24,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650899597] [2019-12-27 00:01:24,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:24,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:01:24,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840152937] [2019-12-27 00:01:24,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:01:24,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:01:24,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:01:24,008 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-27 00:01:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:24,388 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-27 00:01:24,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:01:24,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:01:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:24,427 INFO L225 Difference]: With dead ends: 25803 [2019-12-27 00:01:24,427 INFO L226 Difference]: Without dead ends: 23832 [2019-12-27 00:01:24,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:01:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-27 00:01:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-27 00:01:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-27 00:01:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-27 00:01:24,703 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-27 00:01:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:24,703 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-27 00:01:24,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:01:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-27 00:01:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:24,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:24,719 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-27 00:01:24,719 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:24,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:24,719 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 00:01:24,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:24,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517738249] [2019-12-27 00:01:24,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:24,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517738249] [2019-12-27 00:01:24,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:24,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:01:24,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888205109] [2019-12-27 00:01:24,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:01:24,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:01:24,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:01:24,772 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-27 00:01:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:24,881 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-27 00:01:24,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:01:24,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 00:01:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:24,928 INFO L225 Difference]: With dead ends: 18737 [2019-12-27 00:01:24,928 INFO L226 Difference]: Without dead ends: 18737 [2019-12-27 00:01:24,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:01:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-27 00:01:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-27 00:01:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-27 00:01:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-27 00:01:25,403 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-27 00:01:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:25,404 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-27 00:01:25,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:01:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-27 00:01:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:25,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:25,436 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-27 00:01:25,436 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 00:01:25,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:25,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024265096] [2019-12-27 00:01:25,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:25,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024265096] [2019-12-27 00:01:25,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:25,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:01:25,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370088933] [2019-12-27 00:01:25,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:01:25,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:25,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:01:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:01:25,533 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-27 00:01:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:26,296 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-27 00:01:26,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:01:26,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 00:01:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:26,354 INFO L225 Difference]: With dead ends: 31543 [2019-12-27 00:01:26,355 INFO L226 Difference]: Without dead ends: 31459 [2019-12-27 00:01:26,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:01:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-27 00:01:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-27 00:01:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-27 00:01:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-27 00:01:27,244 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-27 00:01:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:27,245 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-27 00:01:27,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:01:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-27 00:01:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:27,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:27,280 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-27 00:01:27,281 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 00:01:27,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:27,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28342366] [2019-12-27 00:01:27,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:27,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-27 00:01:27,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28342366] [2019-12-27 00:01:27,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:27,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:01:27,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289207416] [2019-12-27 00:01:27,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:01:27,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:01:27,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:01:27,392 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-27 00:01:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:28,324 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-27 00:01:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:01:28,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:01:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:28,371 INFO L225 Difference]: With dead ends: 31464 [2019-12-27 00:01:28,372 INFO L226 Difference]: Without dead ends: 31342 [2019-12-27 00:01:28,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:01:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-27 00:01:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-27 00:01:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-27 00:01:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-27 00:01:28,822 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-27 00:01:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:28,822 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-27 00:01:28,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:01:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-27 00:01:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:28,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:28,855 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-27 00:01:28,855 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 00:01:28,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:28,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533753939] [2019-12-27 00:01:28,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:29,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533753939] [2019-12-27 00:01:29,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:29,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:01:29,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731211824] [2019-12-27 00:01:29,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:01:29,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:29,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:01:29,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:01:29,012 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-27 00:01:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:30,798 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-27 00:01:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 00:01:30,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 00:01:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:30,861 INFO L225 Difference]: With dead ends: 41056 [2019-12-27 00:01:30,861 INFO L226 Difference]: Without dead ends: 41056 [2019-12-27 00:01:30,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:01:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-27 00:01:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-27 00:01:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-27 00:01:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-27 00:01:31,900 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-27 00:01:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:31,900 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-27 00:01:31,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:01:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-27 00:01:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:01:31,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:31,929 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-27 00:01:31,929 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 00:01:31,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:31,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362638064] [2019-12-27 00:01:31,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:31,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362638064] [2019-12-27 00:01:31,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:31,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:01:31,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329127683] [2019-12-27 00:01:31,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:01:31,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:01:31,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:01:31,987 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-27 00:01:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:32,068 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-27 00:01:32,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:01:32,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 00:01:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:32,102 INFO L225 Difference]: With dead ends: 17418 [2019-12-27 00:01:32,102 INFO L226 Difference]: Without dead ends: 17418 [2019-12-27 00:01:32,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:01:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-27 00:01:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-27 00:01:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-27 00:01:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-27 00:01:32,390 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-27 00:01:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:32,391 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-27 00:01:32,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:01:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-27 00:01:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:01:32,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:32,410 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-27 00:01:32,410 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:32,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-27 00:01:32,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:32,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871686085] [2019-12-27 00:01:32,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:32,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871686085] [2019-12-27 00:01:32,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:32,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:01:32,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139342486] [2019-12-27 00:01:32,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:01:32,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:32,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:01:32,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:01:32,532 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 7 states. [2019-12-27 00:01:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:33,392 INFO L93 Difference]: Finished difference Result 23352 states and 69676 transitions. [2019-12-27 00:01:33,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:01:33,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 00:01:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:33,425 INFO L225 Difference]: With dead ends: 23352 [2019-12-27 00:01:33,425 INFO L226 Difference]: Without dead ends: 23216 [2019-12-27 00:01:33,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:01:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23216 states. [2019-12-27 00:01:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23216 to 18293. [2019-12-27 00:01:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18293 states. [2019-12-27 00:01:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18293 states to 18293 states and 55408 transitions. [2019-12-27 00:01:33,757 INFO L78 Accepts]: Start accepts. Automaton has 18293 states and 55408 transitions. Word has length 54 [2019-12-27 00:01:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:33,757 INFO L462 AbstractCegarLoop]: Abstraction has 18293 states and 55408 transitions. [2019-12-27 00:01:33,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:01:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18293 states and 55408 transitions. [2019-12-27 00:01:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:01:33,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:33,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:33,781 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069858, now seen corresponding path program 2 times [2019-12-27 00:01:33,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:33,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87045360] [2019-12-27 00:01:33,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:33,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87045360] [2019-12-27 00:01:33,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:33,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:01:33,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544098964] [2019-12-27 00:01:33,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:01:33,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:33,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:01:33,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:01:33,926 INFO L87 Difference]: Start difference. First operand 18293 states and 55408 transitions. Second operand 9 states. [2019-12-27 00:01:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:35,771 INFO L93 Difference]: Finished difference Result 23511 states and 69927 transitions. [2019-12-27 00:01:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 00:01:35,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 00:01:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:35,805 INFO L225 Difference]: With dead ends: 23511 [2019-12-27 00:01:35,805 INFO L226 Difference]: Without dead ends: 23511 [2019-12-27 00:01:35,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 00:01:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23511 states. [2019-12-27 00:01:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23511 to 16096. [2019-12-27 00:01:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16096 states. [2019-12-27 00:01:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16096 states to 16096 states and 49156 transitions. [2019-12-27 00:01:36,556 INFO L78 Accepts]: Start accepts. Automaton has 16096 states and 49156 transitions. Word has length 54 [2019-12-27 00:01:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:36,557 INFO L462 AbstractCegarLoop]: Abstraction has 16096 states and 49156 transitions. [2019-12-27 00:01:36,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:01:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 16096 states and 49156 transitions. [2019-12-27 00:01:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:01:36,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:36,575 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-27 00:01:36,575 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1391330862, now seen corresponding path program 3 times [2019-12-27 00:01:36,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:36,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099075499] [2019-12-27 00:01:36,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:36,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099075499] [2019-12-27 00:01:36,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:36,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 00:01:36,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424041470] [2019-12-27 00:01:36,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:01:36,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:36,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:01:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:01:36,685 INFO L87 Difference]: Start difference. First operand 16096 states and 49156 transitions. Second operand 9 states. [2019-12-27 00:01:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:37,884 INFO L93 Difference]: Finished difference Result 30201 states and 91855 transitions. [2019-12-27 00:01:37,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 00:01:37,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 00:01:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:37,937 INFO L225 Difference]: With dead ends: 30201 [2019-12-27 00:01:37,937 INFO L226 Difference]: Without dead ends: 23426 [2019-12-27 00:01:37,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:01:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23426 states. [2019-12-27 00:01:38,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23426 to 16553. [2019-12-27 00:01:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16553 states. [2019-12-27 00:01:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16553 states to 16553 states and 50075 transitions. [2019-12-27 00:01:38,295 INFO L78 Accepts]: Start accepts. Automaton has 16553 states and 50075 transitions. Word has length 54 [2019-12-27 00:01:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:38,295 INFO L462 AbstractCegarLoop]: Abstraction has 16553 states and 50075 transitions. [2019-12-27 00:01:38,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:01:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16553 states and 50075 transitions. [2019-12-27 00:01:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:01:38,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:38,314 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-27 00:01:38,314 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:38,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1496564564, now seen corresponding path program 4 times [2019-12-27 00:01:38,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:38,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541054757] [2019-12-27 00:01:38,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:38,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541054757] [2019-12-27 00:01:38,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:38,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:01:38,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959028527] [2019-12-27 00:01:38,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:01:38,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:01:38,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:01:38,519 INFO L87 Difference]: Start difference. First operand 16553 states and 50075 transitions. Second operand 11 states. [2019-12-27 00:01:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:39,599 INFO L93 Difference]: Finished difference Result 32000 states and 96391 transitions. [2019-12-27 00:01:39,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 00:01:39,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 00:01:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:39,647 INFO L225 Difference]: With dead ends: 32000 [2019-12-27 00:01:39,647 INFO L226 Difference]: Without dead ends: 30902 [2019-12-27 00:01:39,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:01:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30902 states. [2019-12-27 00:01:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30902 to 18971. [2019-12-27 00:01:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18971 states. [2019-12-27 00:01:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18971 states to 18971 states and 57155 transitions. [2019-12-27 00:01:40,018 INFO L78 Accepts]: Start accepts. Automaton has 18971 states and 57155 transitions. Word has length 54 [2019-12-27 00:01:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:40,019 INFO L462 AbstractCegarLoop]: Abstraction has 18971 states and 57155 transitions. [2019-12-27 00:01:40,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:01:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand 18971 states and 57155 transitions. [2019-12-27 00:01:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:01:40,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:40,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:40,041 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash 845727880, now seen corresponding path program 5 times [2019-12-27 00:01:40,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:40,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819154664] [2019-12-27 00:01:40,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:40,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819154664] [2019-12-27 00:01:40,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:40,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:01:40,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962652161] [2019-12-27 00:01:40,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:01:40,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:40,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:01:40,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:01:40,245 INFO L87 Difference]: Start difference. First operand 18971 states and 57155 transitions. Second operand 11 states. [2019-12-27 00:01:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:41,809 INFO L93 Difference]: Finished difference Result 31387 states and 94014 transitions. [2019-12-27 00:01:41,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 00:01:41,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 00:01:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:41,847 INFO L225 Difference]: With dead ends: 31387 [2019-12-27 00:01:41,847 INFO L226 Difference]: Without dead ends: 25808 [2019-12-27 00:01:41,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:01:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25808 states. [2019-12-27 00:01:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25808 to 15801. [2019-12-27 00:01:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15801 states. [2019-12-27 00:01:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15801 states to 15801 states and 47745 transitions. [2019-12-27 00:01:42,151 INFO L78 Accepts]: Start accepts. Automaton has 15801 states and 47745 transitions. Word has length 54 [2019-12-27 00:01:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:42,152 INFO L462 AbstractCegarLoop]: Abstraction has 15801 states and 47745 transitions. [2019-12-27 00:01:42,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:01:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 15801 states and 47745 transitions. [2019-12-27 00:01:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:01:42,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:42,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:01:42,169 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:42,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 6 times [2019-12-27 00:01:42,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:42,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81452449] [2019-12-27 00:01:42,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:42,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81452449] [2019-12-27 00:01:42,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:42,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:01:42,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088723966] [2019-12-27 00:01:42,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:01:42,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:42,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:01:42,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:01:42,233 INFO L87 Difference]: Start difference. First operand 15801 states and 47745 transitions. Second operand 3 states. [2019-12-27 00:01:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:42,310 INFO L93 Difference]: Finished difference Result 15799 states and 47740 transitions. [2019-12-27 00:01:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:01:42,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 00:01:42,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:42,349 INFO L225 Difference]: With dead ends: 15799 [2019-12-27 00:01:42,349 INFO L226 Difference]: Without dead ends: 15799 [2019-12-27 00:01:42,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:01:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15799 states. [2019-12-27 00:01:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15799 to 14369. [2019-12-27 00:01:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14369 states. [2019-12-27 00:01:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14369 states to 14369 states and 43776 transitions. [2019-12-27 00:01:42,731 INFO L78 Accepts]: Start accepts. Automaton has 14369 states and 43776 transitions. Word has length 54 [2019-12-27 00:01:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:42,732 INFO L462 AbstractCegarLoop]: Abstraction has 14369 states and 43776 transitions. [2019-12-27 00:01:42,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:01:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 14369 states and 43776 transitions. [2019-12-27 00:01:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:01:42,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:42,755 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-27 00:01:42,755 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:42,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 1 times [2019-12-27 00:01:42,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:42,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578190083] [2019-12-27 00:01:42,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:01:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:01:43,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578190083] [2019-12-27 00:01:43,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:01:43,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:01:43,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723573001] [2019-12-27 00:01:43,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:01:43,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:01:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:01:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:01:43,097 INFO L87 Difference]: Start difference. First operand 14369 states and 43776 transitions. Second operand 15 states. [2019-12-27 00:01:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:01:46,219 INFO L93 Difference]: Finished difference Result 24874 states and 74945 transitions. [2019-12-27 00:01:46,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 00:01:46,220 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 00:01:46,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:01:46,256 INFO L225 Difference]: With dead ends: 24874 [2019-12-27 00:01:46,256 INFO L226 Difference]: Without dead ends: 24526 [2019-12-27 00:01:46,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=420, Invalid=2130, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 00:01:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24526 states. [2019-12-27 00:01:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24526 to 14223. [2019-12-27 00:01:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14223 states. [2019-12-27 00:01:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14223 states to 14223 states and 43434 transitions. [2019-12-27 00:01:46,535 INFO L78 Accepts]: Start accepts. Automaton has 14223 states and 43434 transitions. Word has length 55 [2019-12-27 00:01:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:01:46,536 INFO L462 AbstractCegarLoop]: Abstraction has 14223 states and 43434 transitions. [2019-12-27 00:01:46,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:01:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 14223 states and 43434 transitions. [2019-12-27 00:01:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:01:46,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:01:46,550 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-27 00:01:46,550 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:01:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:01:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 2 times [2019-12-27 00:01:46,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:01:46,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866606403] [2019-12-27 00:01:46,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:01:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:01:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:01:46,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:01:46,651 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:01:46,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2345~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| 4)) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24|) 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24| 1) |v_#valid_59|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24|) |v_ULTIMATE.start_main_~#t2345~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= 0 |v_ULTIMATE.start_main_~#t2345~0.offset_18|) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2345~0.offset=|v_ULTIMATE.start_main_~#t2345~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_26|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ULTIMATE.start_main_~#t2345~0.base=|v_ULTIMATE.start_main_~#t2345~0.base_24|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2345~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2347~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2346~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2346~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2345~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 00:01:46,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2346~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2346~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13|) |v_ULTIMATE.start_main_~#t2346~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_11|, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2346~0.offset, ULTIMATE.start_main_~#t2346~0.base] because there is no mapped edge [2019-12-27 00:01:46,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2347~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2347~0.base_13| 0)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13|) |v_ULTIMATE.start_main_~#t2347~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2347~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2347~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 00:01:46,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1327987676 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1327987676|) (= ~x$w_buff1~0_Out1327987676 ~x$w_buff0~0_In1327987676) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1327987676|) (= P1Thread1of1ForFork0_~arg.base_Out1327987676 |P1Thread1of1ForFork0_#in~arg.base_In1327987676|) (= ~x$w_buff0_used~0_In1327987676 ~x$w_buff1_used~0_Out1327987676) (= (mod ~x$w_buff1_used~0_Out1327987676 256) 0) (= ~x$w_buff0_used~0_Out1327987676 1) (= P1Thread1of1ForFork0_~arg.offset_Out1327987676 |P1Thread1of1ForFork0_#in~arg.offset_In1327987676|) (= 1 ~x$w_buff0~0_Out1327987676)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1327987676, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1327987676|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1327987676|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1327987676} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1327987676, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1327987676, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out1327987676, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out1327987676, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1327987676|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1327987676|, ~x$w_buff1~0=~x$w_buff1~0_Out1327987676, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1327987676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1327987676, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1327987676} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 00:01:46,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In37578804 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In37578804 256) 0))) (or (and (= ~x~0_In37578804 |P2Thread1of1ForFork1_#t~ite32_Out37578804|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out37578804| ~x$w_buff1~0_In37578804)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In37578804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In37578804, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In37578804, ~x~0=~x~0_In37578804} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out37578804|, ~x$w_buff1~0=~x$w_buff1~0_In37578804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In37578804, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In37578804, ~x~0=~x~0_In37578804} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 00:01:46,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 00:01:46,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1583275817 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1583275817 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1583275817|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1583275817 |P2Thread1of1ForFork1_#t~ite34_Out-1583275817|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1583275817, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1583275817} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1583275817|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1583275817, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1583275817} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 00:01:46,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2094856577 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2094856577 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-2094856577| 0)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2094856577| ~x$w_buff0_used~0_In-2094856577) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2094856577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2094856577} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2094856577, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2094856577|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2094856577} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 00:01:46,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2127154644 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2127154644 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2127154644 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2127154644 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out2127154644| ~x$w_buff1_used~0_In2127154644) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite29_Out2127154644| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2127154644, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2127154644, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2127154644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2127154644} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2127154644, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2127154644, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2127154644, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2127154644|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2127154644} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 00:01:46,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-298569020 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-298569020 256)))) (or (and (= ~x$r_buff0_thd2~0_In-298569020 ~x$r_buff0_thd2~0_Out-298569020) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out-298569020) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-298569020, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-298569020} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-298569020|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-298569020, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-298569020} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 00:01:46,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In73299470 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In73299470 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In73299470 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In73299470 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In73299470 |P1Thread1of1ForFork0_#t~ite31_Out73299470|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out73299470|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In73299470, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In73299470, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In73299470, ~x$w_buff0_used~0=~x$w_buff0_used~0_In73299470} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out73299470|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In73299470, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In73299470, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In73299470, ~x$w_buff0_used~0=~x$w_buff0_used~0_In73299470} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 00:01:46,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 00:01:46,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1753613369 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out-1753613369| ~x$w_buff1~0_In-1753613369) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1753613369 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1753613369 256)) (and (= (mod ~x$r_buff1_thd1~0_In-1753613369 256) 0) .cse0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1753613369 256))))) .cse1 (= |P0Thread1of1ForFork2_#t~ite12_Out-1753613369| |P0Thread1of1ForFork2_#t~ite11_Out-1753613369|)) (and (= |P0Thread1of1ForFork2_#t~ite11_In-1753613369| |P0Thread1of1ForFork2_#t~ite11_Out-1753613369|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1753613369| ~x$w_buff1~0_In-1753613369) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1753613369, ~x$w_buff1~0=~x$w_buff1~0_In-1753613369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1753613369, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1753613369, ~weak$$choice2~0=~weak$$choice2~0_In-1753613369, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1753613369|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1753613369} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1753613369, ~x$w_buff1~0=~x$w_buff1~0_In-1753613369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1753613369, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1753613369, ~weak$$choice2~0=~weak$$choice2~0_In-1753613369, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1753613369|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1753613369|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1753613369} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 00:01:46,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1616535430 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out1616535430| ~x$w_buff0_used~0_In1616535430) (= |P0Thread1of1ForFork2_#t~ite14_In1616535430| |P0Thread1of1ForFork2_#t~ite14_Out1616535430|)) (and .cse0 (= ~x$w_buff0_used~0_In1616535430 |P0Thread1of1ForFork2_#t~ite14_Out1616535430|) (= |P0Thread1of1ForFork2_#t~ite15_Out1616535430| |P0Thread1of1ForFork2_#t~ite14_Out1616535430|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1616535430 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1616535430 256))) (= (mod ~x$w_buff0_used~0_In1616535430 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1616535430 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1616535430, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1616535430, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1616535430, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1616535430|, ~weak$$choice2~0=~weak$$choice2~0_In1616535430, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1616535430} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1616535430, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1616535430, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1616535430|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1616535430, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1616535430|, ~weak$$choice2~0=~weak$$choice2~0_In1616535430, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1616535430} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 00:01:46,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1116817107 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out1116817107| |P0Thread1of1ForFork2_#t~ite17_Out1116817107|) (= ~x$w_buff1_used~0_In1116817107 |P0Thread1of1ForFork2_#t~ite17_Out1116817107|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1116817107 256)))) (or (= (mod ~x$w_buff0_used~0_In1116817107 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In1116817107 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In1116817107 256) 0) .cse1)))) (and (= |P0Thread1of1ForFork2_#t~ite17_In1116817107| |P0Thread1of1ForFork2_#t~ite17_Out1116817107|) (= |P0Thread1of1ForFork2_#t~ite18_Out1116817107| ~x$w_buff1_used~0_In1116817107) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1116817107, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1116817107|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116817107, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1116817107, ~weak$$choice2~0=~weak$$choice2~0_In1116817107, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116817107} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1116817107, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1116817107|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1116817107|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116817107, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1116817107, ~weak$$choice2~0=~weak$$choice2~0_In1116817107, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116817107} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 00:01:46,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 00:01:47,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 00:01:47,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-126441130 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-126441130 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-126441130 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-126441130 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-126441130|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-126441130 |P2Thread1of1ForFork1_#t~ite35_Out-126441130|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-126441130, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-126441130, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-126441130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-126441130} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-126441130|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-126441130, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-126441130, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-126441130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-126441130} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 00:01:47,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-417765966 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-417765966 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-417765966| ~x$r_buff0_thd3~0_In-417765966)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-417765966|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-417765966, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-417765966} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-417765966|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-417765966, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-417765966} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 00:01:47,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In-457100868 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-457100868 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-457100868 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-457100868 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-457100868|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-457100868| ~x$r_buff1_thd3~0_In-457100868)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-457100868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-457100868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-457100868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457100868} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-457100868|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-457100868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-457100868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-457100868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457100868} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 00:01:47,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 00:01:47,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~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-27 00:01:47,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-490604717 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-490604717 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-490604717| ~x~0_In-490604717) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-490604717 |ULTIMATE.start_main_#t~ite41_Out-490604717|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-490604717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490604717, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490604717, ~x~0=~x~0_In-490604717} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-490604717|, ~x$w_buff1~0=~x$w_buff1~0_In-490604717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490604717, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490604717, ~x~0=~x~0_In-490604717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 00:01:47,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 00:01:47,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-752814117 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-752814117 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-752814117 |ULTIMATE.start_main_#t~ite43_Out-752814117|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-752814117|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-752814117, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-752814117} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-752814117, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-752814117|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-752814117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 00:01:47,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-514372232 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-514372232 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-514372232 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-514372232 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-514372232 |ULTIMATE.start_main_#t~ite44_Out-514372232|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-514372232|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-514372232, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-514372232, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-514372232, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-514372232} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-514372232, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-514372232, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-514372232, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-514372232|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-514372232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 00:01:47,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In712314129 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In712314129 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In712314129 |ULTIMATE.start_main_#t~ite45_Out712314129|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out712314129|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In712314129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712314129} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In712314129, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out712314129|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In712314129} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 00:01:47,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1708936433 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1708936433 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1708936433 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1708936433 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1708936433 |ULTIMATE.start_main_#t~ite46_Out1708936433|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1708936433|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1708936433, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1708936433, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1708936433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1708936433} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1708936433, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1708936433|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1708936433, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1708936433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1708936433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 00:01:47,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:01:47,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:01:47 BasicIcfg [2019-12-27 00:01:47,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:01:47,202 INFO L168 Benchmark]: Toolchain (without parser) took 82400.68 ms. Allocated memory was 147.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 104.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 00:01:47,202 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 00:01:47,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.76 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 103.9 MB in the beginning and 157.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:01:47,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.67 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:01:47,204 INFO L168 Benchmark]: Boogie Preprocessor took 38.70 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:01:47,205 INFO L168 Benchmark]: RCFGBuilder took 838.44 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 106.0 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:01:47,205 INFO L168 Benchmark]: TraceAbstraction took 80639.90 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 105.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 00:01:47,208 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.53 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.76 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 103.9 MB in the beginning and 157.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.67 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.70 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 838.44 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 106.0 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80639.90 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 105.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 79.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4966 SDtfs, 6125 SDslu, 16904 SDs, 0 SdLazy, 10579 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 62 SyntacticMatches, 21 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 151906 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 964 ConstructedInterpolants, 0 QuantifiedInterpolants, 182969 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...